Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results

From MaRDI portal

Revision as of 03:15, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4427359

Jump to:navigation, search

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

Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4427359&oldid=18467231"