Optimization by simulated annealing
From MaRDI portal
Publication:82025
DOI10.1126/SCIENCE.220.4598.671zbMATH Open1225.90162OpenAlexW2024060531WikidataQ25939004 ScholiaQ25939004MaRDI QIDQ82025FDOQ82025
Authors: S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Scott Kirkpatrick, C. D. Jun. Gelatt, M. P. Vecchi
Publication date: 13 May 1983
Published in: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1126/science.220.4598.671
Recommendations
- scientific article; zbMATH DE number 4048925
- scientific article; zbMATH DE number 4085427
- Using simulated annealing to solve routing and location problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Statistical mechanics: a general approach to combinatorial optimization
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
This page was built for publication: Optimization by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q82025)