Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
From MaRDI portal
Publication:4427359
DOI10.1287/ijoc.11.1.35zbMath1034.90524OpenAlexW2163239947MaRDI QIDQ4427359
M. A. Fleischer, Jacobson, Sheldon H.
Publication date: 1999
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10919/25830
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Information theory (general) (94A15)
Related Items (3)
An analysis of neighborhood functions on generic solution spaces ⋮ Analysis of static simulated annealing algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms
This page was built for publication: Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
