Perfect and Ideal 0, ±1 Matrices

DOI10.1287/moor.23.2.322zbMath0982.15020OpenAlexW2102299810MaRDI QIDQ2757536

Guenin, Bertrand

Publication date: 26 November 2001

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

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

zbMATH Keywords

coveringinteger programmingpackingpolytoperesolutionperfect and ideal matricestotal dual integrabilitymonotone completions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)

Related Items (10)

Clean Clutters and Dyadic Fractional Packings ⋮ \((0,\pm 1)\) ideal matrices ⋮ (0, ±1) ideal matrices ⋮ Balanced matrices ⋮ Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs ⋮ Cuboids, a class of clutters ⋮ Ideal clutters ⋮ Perfect, ideal and balanced matrices ⋮ Ideal Clutters That Do Not Pack ⋮ Resistant Sets in the Unit Hypercube

This page was built for publication: Perfect and Ideal 0, ±1 Matrices