Two special cases of the assignment problem
From MaRDI portal
Publication:1219828
DOI10.1016/0012-365X(75)90014-XzbMath0311.90066MaRDI QIDQ1219828
Shuo-Yen Robert Li, Richard M. Karp
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (13)
Efficient many-to-Many point matching in one dimension ⋮ Graded Matching for Large Observational Studies ⋮ An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension ⋮ Perspectives of Monge properties in optimization ⋮ A linear time algorithm for a matching problem on the circle ⋮ Comment: Matching methods for observational studies derived from large administrative databases ⋮ Assigning agents to a line ⋮ Minimum many-to-many matchings for computing the distance between two sequences ⋮ Minimum-weight perfect matching for nonintrinsic distances on the line ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs ⋮ Fast algorithms for convex cost flow problems on circles, lines, and trees ⋮ An algorithm for computing the restriction s|caffold assignment problem in computational biology
This page was built for publication: Two special cases of the assignment problem
