On the Euclidean assignment problem

DOI10.1016/0377-0427(88)90001-5zbMATH Open0654.90070OpenAlexW2071552074MaRDI QIDQ1108932FDOQ1108932

Authors: 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

Recommendations

• The number of optimal matchings for Euclidean assignment on the line
• The Euclidean Matching Problem
• The assignment problem revisited
• On solving a variation of the assignment problem
• scientific article; zbMATH DE number 776093
• scientific article; zbMATH DE number 1202983
• The Euclidean \(k\)-supplier problem
• The Euclidean \(k\)-supplier problem
• The Euclidean Multifacility Location Problem
• scientific article; zbMATH DE number 1803767

zbMATH Keywords

permutationsasymptotic optimalitybipartite matchingEuclidean 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)

Cites Work

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

Cited In (9)

• Euclidean maximum matchings in the plane -- local to global
• Fiber-to-object assignment heuristics
• The Euclidean \(k\)-supplier problem in \(\mathbb R^2\)
• On Assignment Problems Related to Gromov–Wasserstein Distances on the Real Line
• On the Euclidean two paths problem
• The Euclidean Matching Problem
• Title not available (Why is that?)
• Euclidean maximum matchings in the plane -- local to global
• A partitioning algorithm for minimum weighted Euclidean matching

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

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