Technical Note—A “Hard” Assignment Problem

DOI10.1287/opre.24.1.190zbMath0324.90044OpenAlexW2087767392MaRDI QIDQ4088571

Michael Wien, Robert E. MacHol

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.1.190

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (6)

Solving the \(k\)-cardinality assignment problem by transformation ⋮ Towards auction algorithms for large dense assignment problems ⋮ Primal-dual algorithms for the assignment problem ⋮ The \(k\)-cardinality assignment problem ⋮ Solving the rectangular assignment problem and applications ⋮ Algorithms and codes for dense assignment problems: The state of the art

This page was built for publication: Technical Note—A “Hard” Assignment Problem