Metropolis Versus Simulated Annealing and the Black-Box-Complexity of Optimization Problems

Ingo Wegener ()
Additional contact information
Ingo Wegener: Technische Universität Dortmund

A chapter in COMPSTAT 2008, 2008, pp 517-527 from Springer

Abstract: Abstract Many real-world optimization problems cannot be modeled by a well-described objective function to apply methods from mathematical optimization theory. Then randomized search heuristics are applied - often with good success. Although heuristical by nature, they are algorithms and can be analyzed like all randomized algorithms, at least in principle. Two fundamental results of this kind are presented to show how such a theory can be developed.

Keywords: randomized search heuristics; minimum spanning tree; black-box-complexity (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-2084-3_42

Ordering information: This item can be ordered from
http://www.springer.com/9783790820843

DOI: 10.1007/978-3-7908-2084-3_42

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().