(0, ±1) ideal matrices

Mathematical Programming, Series B

Volumn 80, Issue 3, 1998, Pages 265-281

  Nobili, Paolo ^a   Sassano, Antonio ^b  

^a CNR   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

(0, 1) matrices; Generalized set covering problem; Lehman's theorem; Perfect and ideal matrices

Indexed keywords

EID: 0004656160     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581169     Document Type: Article

References (8)

1. M. Conforti and G. Cornuéjols, Balanced 0, ±1 matrices, bicoloring and total dual integrality, Mathematical Programming 71 (1995) 249-258.
2. G. Cornuéjols and B. Novick, Ideal 0, 1 matrices, Journal of Combinatorial Theory Series B 60 (1994) 145-157.
3. B. Guenin, Perfect and ideal (0, ±1) matrices, Technical Report, GSIA, Carnegie Mellon University, 1994.
4. J. Hooker, Resolution and integrality of satisfiability problems, Technical Report, GSIA, Carnegie Mellon University, 1994.
5. A. Lehman, On the width-length inequality, Mathematical Programming 17 (1979) 403-413.
6. M.W. Padberg, Lehman's forbidden minor characterization of ideal 0, 1 matrices, Working Paper No. 334, École Polytechnique, Laboratoire d'Économetrie, Paris, France, 1990.
7. P.D. Seymour, On Lehman's width-length characterization, in: W. Cook and P.D. Seymour (eds.), Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1 (1990) 107-117.
8. K. Truemper, On balanced matrices and Tutte's characterization of regular matroids, preprint, 1978.