Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem

DOI10.1051/RO/1986200301771MaRDI QIDQ4729617zbMATH OpenOpenAlexFDO

Authors Jean-Luc Lutton, Ernesto Bonomi

Publication date 1986

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104900

zbMATH Keywords

Metropolis procedureminimum weighted matchingrandomized heuristicsimulated annealing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Recommendations

• An efficient heuristic algorithm for minimum matching
• Euclidean matching problems and the metropolis algorithm
• A partitioning algorithm for minimum weighted Euclidean matching
• A new class of heuristic algorithms for weighted perfect matching
• A Monte Carlo solution to the minimal Euclidean matching

Cited in

(7)

• Nested annealing: A provable improvement to simulated annealing
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
• Metaheuristics: A bibliography
• An efficient heuristic algorithm for minimum matching
• Euclidean matching problems and the metropolis algorithm
• scientific article; zbMATH DE number 5590060 (Why is no real title available?)
• A partitioning algorithm for minimum weighted Euclidean matching

This page was built for publication: Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem

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