Startseite UB

Search-space smoothing for combinatorial optimization problems

Schneider, Johannes and Dankesreiter, Markus and Fettes, Werner and Morgenstern, Ingo and Schmid, Martin and Singer, Johannes Maria (1997) Search-space smoothing for combinatorial optimization problems. Physica A Statistical Mechanics and its Applications 243 (1-2), pp. 77-112.

Download (1MB) - Repository staff only

at publisher (via DOI)


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 ...


Export bibliographical data

Item Type:Article
Date:September 1997
Institutions:Physics > Institute of Theroretical Physics > Professor Morgenstern
Identification Number:
02.50.-r; 02.50.Ga; 02.70.Lg; 89.20.+a; 89.80.+h; 89.90.+nPACS
Keywords:Optimization; Monte Carlo; Traveling salesman; Great deluge; Smoothing; Local searc
Subjects:500 Science > 530 Physics
Created at the University of Regensburg:Unknown
Owner: Martin Kaiser
Deposited On:09 Aug 2010 12:25
Last Modified:13 Mar 2014 13:57
Item ID:16113
Owner Only: item control page
  1. University

University Library

Publication Server

Contact person
Gernot Deinzer

Telefon 0941 943-2759