Go to content
UR Home

Search-space smoothing for combinatorial optimization problems

DOI to cite this document:
Schneider, Johannes ; Dankesreiter, Markus ; Fettes, Werner ; Morgenstern, Ingo ; Schmid, Martin ; Singer, Johannes Maria
(1MB) - Repository staff only
Date of publication of this fulltext: 09 Aug 2010 12:25


Commonly there are two types of local search approaches known to treat combinatorial optimization problems with very complex search-space structure: One is to introduce very complicated types of local move classes, allowing a bypass of high energetic barriers separating different minima. The second is introducing a control-parameter (i.e. temperature in physics terminology) dependent state space ...


Owner only: item control page
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons