Vertex packings: Structural properties and algorithms
 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 a binary integer programming formulation (VP) for the weighted vertex packing problem in a simple graph. A sufficient “local” optimality condition for (VP) is given and this result is used to derive relations between (VP) and the linear program (VLP) obtained by deleting the integrality restrictions in (VP). Our most striking result is that those variables which assume binary values in an optimum (VLP) solution retain the same values in an optimum (VP) solution. This result is of interest because variables are (0, 1/2, 1). valued in basic feasible solutions to (VLP) and (VLP) can be solved by a “good” algorithm. This relationship and other optimality conditions are incorporated into an implicit enumeration algorithm for solving (VP). Some computational experience is reported.
 E. Balas and H. Samuelsson, “Finding a minimum node cover in an arbitrary graph”, Management Sciences Research Rept. No. 325, Graduate School of Industrial Administration, CarnegieMellon University, Pittsburgh, Pa. (November 1973).
 M.L. Balinski, “On maximum matching, minimum covering and their connections”, in: H.W. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming, (Princeton University Press, Princeton, N.J., 1970) pp. 303–312.
 C. Berge,The theory of graphs and its applications (Methuen, London, 1962).
 V. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques238, Université de Montréal (October 1972).
 V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems”,Discrete Mathematics 5 (1973) 305–337.
 J. Edmonds, “Covers and packings in a family of sets”,Bulletin of the American Mathematical Society 68 (1962) 494–499.
 J. Edmonds, “Paths, trees, and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.
 L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).
 D.R. Fulkerson, “Antiblocking polyhedra”,Journal of Combinatorial Theory 12 (1972) 50–71.
 F. Gavril, “Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph”,SIAM Journal of Computing 1 (1972) 180–187.
 A.M. Geoffrion, “An improved implicit enumeration approach for integer programming”,Operations Research 17 (1969) 437–454.
 R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller, J.W. Thatcher and J.D. Bohlinger, eds.,Complexity of computer computations (Plenum Press, New York, 1972) pp. 85–103.
 C.E. Lemke, H.M. Salkin and K. Spielberg, “Set covering by single branch enumeration with linear programming subproblems”,Operations Research 19 (1971) 998–1022.
 G.L. Nemhauser and L.E. Trotter, Jr., “Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61.
 M. Padberg, “On the facial structure of set packing polyhedra”,Mathematical programming 5 (1973) 199–216.
 R. Tarjan, “Finding a maximum clique”, Tech. Rept. 72123, Dept. of Computer Science, Cornell University, Ithaca, N.Y. (March 1972).
 L.E. Trotter, Jr., “Solution characteristics and algorithms for the vertex packing problem”, Tech. Rept. No. 168, Dept. of Operations Research, Cornell University, Ithaca, N.Y. (January 1973).
 L.E. Trotter, Jr., “A class of facet producing graphs for vertex packing polyhedra”, Research Rept. No. 78, Dept. of Administrative Sciences, Yale University, New Haven, Conn. (February 1974).
 Title
 Vertex packings: Structural properties and algorithms
 Journal

Mathematical Programming
Volume 8, Issue 1 , pp 232248
 Cover Date
 19751201
 DOI
 10.1007/BF01580444
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

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

 1. Cornell University, Ithaca, N.Y., USA
 2. Yale University, New Haven, Conn., USA