Lutton, Jean-Luc; Bonomi, Ernesto Simulated annealing algorithm for the minimum weighted perfect Euclidean matching problem. (English) Zbl 0679.90051 RAIRO, Rech. Opér. 20, 177-197 (1986). Summary: A randomized heuristic derived from the Metropolis procedure is proposed to solve the minimum weighted matching problem. In the limit of large problems, the average behaviour of the minimum cost of the perfect matching in the two-dimensional Euclidean space is investigated for different probability distributions of points. Cited in 4 Documents MSC: 90C27 Combinatorial optimization 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 65K05 Numerical mathematical programming methods Keywords:simulated annealing; randomized heuristic; Metropolis procedure; minimum weighted matching PDFBibTeX XMLCite \textit{J.-L. Lutton} and \textit{E. Bonomi}, RAIRO, Rech. Opér. 20, 177--197 (1986; Zbl 0679.90051) Full Text: DOI EuDML