Find out how to access previewonly content
Properties of vertex packing and independence system polyhedra
 G. L. Nemhauser,
 L. E. Trotter Jr.
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We consider two convex polyhedra related to the vertex packing problem for a finite, undirected, loopless graphG with no multiple edges. A characterization is given for the extreme points of the polyhedron \(\mathcal{L}_G = \{ x \in R^n :Ax \leqslant 1_m ,x \geqslant 0\} \) , whereA is them × n edgevertex incidence matrix ofG and 1_{ m } is anmvector of ones. A general class of facets of = convex hull{x∈R ^{ n }:Ax≤1 _{ m },x binary} is described which subsumes a class examined by Padberg [13]. Some of the results for are extended to a more general class of integer polyhedra obtained from independence systems.
This research was supported by the National Science Foundation under Grant GK32282X to Cornell University and by the United States Army under Contract No. DA31124AROD462 to the Mathematics Research Center, University of Wisconsin, Madison, Wisconsin, U.S.A.
 Balinski, M.L. (1965) Integer programming: Methods, uses, computation. Management Science 12: pp. 253313
 Balinski, M.L. (1972) Establishing the matching polytope. Journal of Combinatorial Theory 13: pp. 113
 Balinski, M.L., Spielberg, K. Methods of integer programming: Algebraic, combinatorial and enumerative. In: Aronofsky, J. eds. (1969) Progress in operations research, Vol. III. Wiley, New York, pp. 195292
 V. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques238, Université de Montréal (October 1972).
 Edmonds, J. (1962) Covers and packings in a family of sets. Bulletin of the American Mathematical Society 68: pp. 494499
 Edmonds, J. (1965) Maximum matching and a polyhedron with (0, 1)vertices. Journal of Research of the National Bureau of Standards 69: pp. 125130
 Edmonds, J. (1971) Matroids and the greedy algorithm. Mathematical Programming 1: pp. 127136
 Fulkerson, D.R. (1971) Blocking and antiblocking pairs of polyhedra. Mathematical Programming 1: pp. 168194
 Fulkerson, D.R. (1972) Antiblocking polyhedra. Journal of Combinatorial Theory 12: pp. 5071
 Garfinkel, R.S., Nemhauser, G.L. A survey of integer programming emphasizing computation and relations among models. In: Hu, T.C., Robinson, S.M. eds. (1973) Mathematical Programming. Academic Press, New York, pp. 77155
 Gomory, R.E. (1969) Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications 2: pp. 451558
 Lovász, L. (1972) Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics 2: pp. 253267
 Padberg, M.W. (1973) On the facial structure of set packing polyhedra. Mathematical Programming 5: pp. 199215
 L.E. Trotter, Jr., “Solution characteristics and algorithms for the vertex packing problem”, Technical Report No. 168. Department of Operations Research, Cornell University (January 1973).
 L.E. Trotter, Jr., “A class of facet producing graphs for vertex packing polyhedra”, Technical Report No. 78, Department of Administrative Sciences, Yale University, (February 1974).
 Title
 Properties of vertex packing and independence system polyhedra
 Journal

Mathematical Programming
Volume 6, Issue 1 , pp 4861
 Cover Date
 19741201
 DOI
 10.1007/BF01580222
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 G. L. Nemhauser ^{(1)}
 L. E. Trotter Jr. ^{(1)}
 Author Affiliations

 1. Cornell University, Ithaca, New York, USA