Perfect and Ideal 0, ±1 Matrices

References

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