On the Euclidean assignment problem
From MaRDI portal
Publication:1108932
DOI10.1016/0377-0427(88)90001-5zbMath0654.90070MaRDI QIDQ1108932
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
permutations; bipartite matching; asymptotic optimality; Euclidean assignment problem; linear time heuristic algorithm
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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