Perfect and ideal 0, ±1 matrices

Mathematics of Operations Research

Volumn 23, Issue 2, 1998, Pages 322-338

  Guenin, Bertrand ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Monotone completions; Perfect and ideal matrices; Resolution; Total dual integrality

Indexed keywords

GRAPH THEORY; MATHEMATICAL TECHNIQUES; OPERATIONS RESEARCH; VECTORS;

GENERALIZED PACKING POLYTOPE; INTEGRALITY; IRREDUCIBILITY; MONOTONE COMPLETION;

MATRIX ALGEBRA;

EID: 0032073023     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.2.322     Document Type: Article

References (22)

1. Boros, E., O. Cepek (1997).On perfect 0 ∓ 1 matrices. Discrete Math. 165-166, 81-100.
2. Chvátal, V. (1973). On certain polytopes associated with graphs. J. Combin Theory Ser. B 18 138-154.
3. Conforti, M., G. Cornuéjols (1995). Balanced 0, ± 1-matrices, bicoloring and total dual integrality. Math. Programming 71 249-258.
4. _, _, C. De Francesco (1997). Perfect 0 ∓ 1 matrices. Linear Alegebra Appl. 253, 299-309.
5. Cornuéjols, G. (1994). Packing and Covering. Class notes. GSIA, Carnegie Mellon Univ., Pittsburgh, PA.
6. De Francesco, C. (1994). Integrality problems for generalized set packing polytopes. Ph.D. dissertation, Univ. of Padova, Italy.
7. Fulkerson, D. R. (1973). On the perfect graph theorem. J. Combin. Theory Ser. B 12 50-71.
8. Hooker, J. N. (1988). A quantitative approach to logical inference. Decision Support Systems 4 45-69.
9. _ (1996). Resolution and the integrality of satisfiability polytopes. Math. Programming 74 1-10.
10. Ikebe, Y. T., A. Tamura (1996) Perfect bidirected graphs. Internal Report. Department of Management Sciences, Univ. of Tokyo.
11. Johnson, E., M. Padberg (1982). Degree-two inequalities, clique facets and biperfect graphs. Discrete Math. 16 169-187.
12. Lehman, A. (1990). On the width-length inequality and degenerate projective planes. W. Cook, P. D. Seymour, eds. Polyhedral Combinatorics. DIMACS Series in Discrete Math, and Theore:. Comput Sci 1 101-105.
13. Li, W. J. (1995). Degree two inequalities and biperfect graphs. Ph.D. dissertation, State Univ. of New York, Stony Brook, NY.
14. Lovász, L. (1972). Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2 253-267.
15. Motzkin, T. S. (1952). Contributions to the theory of linear inequalities. RAND Corporation Translation 22, Santa Monica, CA.
16. Nemhauser, G. L., L. A. Wolsey (1988), Integer and Combinatorial Optimization, Wiley, New York.
17. Nobili, P., A. Sassano (1994). (0, ± 1) Ideal matrices. Math. Programming, (to appear).
18. Padberg, M. W. (1974). Perfect zero-one matrices. Math. Programming 6 180-196.
19. Schrijver, A. (1986). Theory of Linear and Integer Programming, Wiley, New York.
20. Sebo, A. (1996). Personal communication.
21. Sewell, E. C. (1996). Binary integer programs with two variables per inequality. Math. Programming 75 467-476.
22. Truemper, K. (1982). Alfa-balanced graphs and matrices and GF(3)-representabiliry of matroids. J. Combin. Theory Ser. B 32 112-139.