Two special cases of the assignment problem

DOI10.1016/0012-365X(75)90014-XMaRDI QIDQ1219828zbMATH OpenFDO

Authors Richard Karp, Shuo-Yen Robert Li

Publication date 1975

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Nonlinear programming (90C30) Integer programming (90C10)

Cited in

(13)

• Comment: Matching methods for observational studies derived from large administrative databases
• A linear time algorithm for a matching problem on the circle
• Minimum-weight perfect matching for nonintrinsic distances on the line
• An O(n^2) algorithm for the limited-capacity many-to-many point matching in one dimension
• Graded Matching for Large Observational Studies
• 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
• Computational geometric aspects of rhythm, melody, and voice-leading
• An algorithm for computing the restriction s|caffold assignment problem in computational biology
• Assigning agents to a line
• Perspectives of Monge properties in optimization
• Minimum many-to-many matchings for computing the distance between two sequences
• Efficient many-to-Many point matching in one dimension

This page was built for publication: Two special cases of the assignment problem

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