Some Facets for an Assignment Problem with Side Constraints
From MaRDI portal
Publication:3976911
DOI10.1287/OPRE.39.2.244zbMATH Open0744.90061OpenAlexW2095653573MaRDI QIDQ3976911FDOQ3976911
Authors: Ronny Aboudi, G. L. Nemhauser
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
Recommendations
Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cited In (9)
- The \(k\)-cardinality assignment problem
- Title not available (Why is that?)
- Loading tow trains ergonomically for just-in-time part supply
- Facets of an assignment problem with 0-1 constraint
- Resource assignment with preference conditions
- Assignment problem with conflicts
- A constrained matching problem
- Scheduling jobs of equal length: Complexity, facets and computational results
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976911)