\((0,\pm 1)\) ideal matrices

DOI10.1007/BF01581169zbMath0894.90126MaRDI QIDQ1380940

Antonio Sassano, Paolo Nobili

Publication date: 11 March 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Lehman's theorem\((0,\pm 1)\) matricesgeneralized set covering problemperfect and ideal matrices

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Matrices of integers (15B36)

Related Items (8)

Clean Clutters and Dyadic Fractional Packings ⋮ Balanced matrices ⋮ Cuboids, a class of clutters ⋮ Transitive packing ⋮ Ideal clutters ⋮ Perfect, ideal and balanced matrices ⋮ Ideal Clutters That Do Not Pack ⋮ Resistant Sets in the Unit Hypercube

Cites Work

• Unnamed Item
• Ideal 0, 1 matrices
• Resolution and the integrality of satisfiability problems
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• Perfect and Ideal 0, ±1 Matrices
• On the width—length inequality

This page was built for publication: \((0,\pm 1)\) ideal matrices