×
Padberg, Manfred W.

Perfect zero-one matrices. (English) Zbl 0284.90061

Math. Program. 6, 180-196 (1974).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0284.90061

Cited in 6 Reviews
Cited in 97 Documents

MSC:

90C10 Integer programming
90C35 Programming involving graphs or networks
05C35 Extremal problems in graph theory
15B48 Positive matrices and their generalizations; cones of matrices
Cite Review PDF
Full Text: DOI

References:

[1] E. Balas and M.W. Padberg, ”On the set covering problem”,Operations Research 20 (6) (1972). · Zbl 0254.90035
[2] E. Balas and M.W. Padberg, ”On the set covering problem II: An algorithm”, Management Sciences Res. Rept. No. 295 (1972), Carnegie-Mellon University, Pittsburgh, Pa. (presented at the Joint National Meeting of ORSA, TIMS, AIEE, at Atlantic City, November 1972). · Zbl 0254.90035
[3] C. Berge,Graphes et hypergraphes (Dunod, Paris 1970).
[4] C. Berge, Introduction à la theorie des hypergraphes, Lectures Notes, Université de Montreal, Montreal, Que. (summer 1971).
[5] C. Berge, ”Balanced matrices”,Mathematical Programming, 2 (1972) 19–31. · Zbl 0247.05126 · doi:10.1007/BF01584535
[6] V. Chvátal, ”On certain polytopes associated with graphs”, Centre de Recherches Mathematiques, Université de Montreal, Montreal, Que., CRM-238 (October 1972). · Zbl 0277.05139
[7] D.R. Fulkerson, ”Blocking and antiblocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194. · Zbl 0254.90054 · doi:10.1007/BF01584085
[8] D.R. Fulkerson, ”On the perfect graph theorem”, in:Mathematical programming, Eds. T.C. Hu and S.M. Robinson (Academic Press, New York, 1973). · Zbl 0267.05119
[9] F.R. Gantmacher,Matrix theory, Vol II (Chelsea, Bronx, N.Y., 1964).
[10] R. Garfinkel and G. Nemhauser,Integer programming (Wiley, New York, 1972). · Zbl 0259.90022
[11] B. Grünbaum,Convex polytopes (Wiley, New York, 1966).
[12] A.J. Hoffman, ”On combinatorical problems and linear inequalities”, IBM Watson Research Center, Yorktown Heights, N.Y. (paper presented at the 8th International Symposium on Mathematical Programming at Stanford, August 1973).
[13] L. Lovász, ”Normal hypergraphs and the Perfect Graph Conjecture”,Discrete Mathematics 2 (1972) 253–268. · Zbl 0239.05111 · doi:10.1016/0012-365X(72)90006-4
[14] L. Lovász, ”A characterization of perfect graphs”,Journal of Combinatorial Theory (B) 13 (1972) 95–98. · Zbl 0241.05107 · doi:10.1016/0095-8956(72)90045-7
[15] M.W. Padberg, ”On the facial structure of set packing polyhedra”,Mathematical Programming 5 (1973) 199–215. · Zbl 0272.90041 · doi:10.1007/BF01580121
[16] H. Sachs, ”On the Berge conjecture concerning perfect graphs”, in:Combinatorial structures and their applications Eds. R. Guy et al. (Gordon and Breach, New York, 1970). · Zbl 0247.05116
[17] L. Trotter, ”Solution characteristics and algorithms for the vertex packing problem”, Techn. Rept. No. 168, Ph.D. Thesis, Cornell University, Ithaca, N.Y. (January 1973).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.