Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices

DOI10.1287/MOOR.15.2.258MaRDI QIDQ3200884zbMATH OpenOpenAlexFDO

Authors Peter L. Hammer, Toshihide Ibaraki, Yves Crama

Publication date 1990

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.15.2.258

zbMATH Keywords

bipartite graphcoveringdecomposition of matricesmaximum weight independent set problempackingpartitioningstrongly unimodular constraint matrices

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Boolean programming (90C09) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Strong unimodularity for matrices and hypergraphs
• Structural properties and recognition of restricted and strongly unimodular matrices
• On a Class of Totally Unimodular Matrices
• Combinatorial optimization. Packing and covering
• Cones of Matrices and Set-Functions and 0–1 Optimization

Cited in

(3)

• Strong unimodularity for matrices and hypergraphs
• Weakly union-free maximum packings
• Unlabelled Partition Systems: Optimization and Complexity

This page was built for publication: Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices

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