An efficient heuristic algorithm for minimum matching

DOI10.1007/BF01416735MaRDI QIDQ3202140zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01416735

zbMATH Keywords

asymptotic behaviourheuristicminimum matchingrate of convergencesimulated annealing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Recommendations

• Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
• A Monte Carlo solution to the minimal Euclidean matching
• A partitioning algorithm for minimum weighted Euclidean matching
• Euclidean matching problems and the metropolis algorithm
• New primal and dual matching heuristics

Cites work

• An analysis of alternative strategies for implementing matching algorithms
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Euclidean matching problems and the metropolis algorithm
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Optimization by simulated annealing
• Paths, Trees, and Flowers
• Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem

Cited in

(4)

• A Monte Carlo solution to the minimal Euclidean matching
• Euclidean matching problems and the metropolis algorithm
• Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
• A partitioning algorithm for minimum weighted Euclidean matching

This page was built for publication: An efficient heuristic algorithm for minimum matching

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