Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem

DOI10.1051/ro/1986200301771zbMath0679.90051OpenAlexW207357049MaRDI QIDQ4729617

Ernesto Bonomi, Jean-Luc Lutton

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

simulated annealingMetropolis procedurerandomized heuristicminimum weighted matching

Mathematics Subject Classification ID

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

Related Items (4)

An efficient heuristic algorithm for minimum matching ⋮ A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm ⋮ Metaheuristics: A bibliography ⋮ Nested annealing: A provable improvement to simulated annealing

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