The afforestation problem: A heuristic method based on simulated annealing

DOI10.1016/0377-2217(92)90221-TMaRDI QIDQ1197928zbMATH OpenWikidataFDO

Authors Rune Mørk Jørgensen, Hans Thomsen, René Vidal

Publication date 16 January 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(92)90221-T

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Cites work

• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• Equation of state calculations by fast computing machines
• Optimization by simulated annealing
• Polygonal approximation by the minimax method
• Simulated Annealing – An Annotated Bibliography
• Structural analysis of local search heuristics in combinatorial optimization
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(2)

• Metaheuristics: A bibliography
• Fifty years of metaheuristics

This page was built for publication: The afforestation problem: A heuristic method based on simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197928)