Facets of an assignment problem with 0-1 constraint

DOI10.1023/A:1009878328812MaRDI QIDQ1587592zbMATH OpenOpenAlexFDO

Authors Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty

Publication date 20 March 2001

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009878328812

zbMATH Keywords

integer hullfacet inducing inequalitiesconstrained assignment problemfacet lifting scheme

Mathematics Subject Classification ID

Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

• Some Facets for an Assignment Problem with Side Constraints
• Facets of the three-index assignment polytope
• Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
• A weighted perfect matching with constraints on weights of its parts
• scientific article; zbMATH DE number 4066629

Cited in

(4)

• Resource assignment with preference conditions
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
• scientific article; zbMATH DE number 4066629 (Why is no real title available?)
• Some Facets for an Assignment Problem with Side Constraints

This page was built for publication: Facets of an assignment problem with 0-1 constraint

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