Some Facets for an Assignment Problem with Side Constraints
From MaRDI portal
Publication:3976911
DOI10.1287/opre.39.2.244zbMath0744.90061OpenAlexW2095653573MaRDI QIDQ3976911
Nemhauser, George I., Ronny Aboudi
Publication date: 25 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.2.244
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)
Related Items (7)
A constrained matching problem ⋮ The \(k\)-cardinality assignment problem ⋮ Resource assignment with preference conditions ⋮ Scheduling jobs of equal length: Complexity, facets and computational results ⋮ Assignment problem with conflicts ⋮ Loading tow trains ergonomically for just-in-time part supply ⋮ A facet generation and relaxation technique applied to an assignment problem with side constraints
This page was built for publication: Some Facets for an Assignment Problem with Side Constraints