On the Euclidean assignment problem

DOI10.1016/0377-0427(88)90001-5zbMath0654.90070OpenAlexW2071552074MaRDI QIDQ1108932

Franz Rendl

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90001-5

zbMATH Keywords

permutationsbipartite matchingasymptotic optimalityEuclidean assignment problemlinear time heuristic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Euclidean maximum matchings in the plane -- local to global

Cites Work

• Unnamed Item
• A partitioning algorithm for minimum weighted Euclidean matching
• Partitioning heuristics for two geometric maximization problems
• On optimal matchings
• Euclidean matching problems and the metropolis algorithm
• An in-core/out-of-core method for solving large scale assignment problems
• Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
• Heuristics for planar minimum‐weight perfect metchings

This page was built for publication: On the Euclidean assignment problem