Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
Open Access
- 1 January 1986
- journal article
- Published by EDP Sciences in Rairo-Operations Research
- Vol. 20 (3) , 177-197
- https://doi.org/10.1051/ro/1986200301771
Abstract
RO : RAIRO - Operations Research, an international journal on operations research, exploring high level pure and applied aspectsKeywords
This publication has 14 references indexed in Scilit:
- Nonstationary Markov chains and convergence of the annealing algorithmJournal of Statistical Physics, 1985
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- Optimization by simulated annealing: Quantitative studiesJournal of Statistical Physics, 1984
- A survey of heuristics for the weighted matching problemNetworks, 1983
- An analysis of alternative strategies for implementing matching algorithmsNetworks, 1983
- Optimization by Simulated AnnealingScience, 1983
- Heuristics for planar minimum-weight perfect metchingsNetworks, 1983
- Divide and Conquer Heuristics for Minimum Weighted Euclidean MatchingSIAM Journal on Computing, 1983
- On a Greedy Heuristic for Complete MatchingSIAM Journal on Computing, 1981
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959