An efficient heuristic algorithm for minimum matching

DOI10.1007/BF01416735zbMath0715.90081OpenAlexW2049434115MaRDI QIDQ3202140

No author found.

Publication date: 1990

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 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

rate of convergencesimulated annealingasymptotic behaviourheuristicminimum matching

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• An analysis of alternative strategies for implementing matching algorithms
• Euclidean matching problems and the metropolis algorithm
• Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
• Paths, Trees, and Flowers
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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