Skip to main content
Log in

Vertex packings: Structural properties and algorithms

  • Published:
Mathematical Programming Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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, Carnegie-Mellon University, Pittsburgh, Pa. (November 1973).

    Google Scholar 

  2. 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.

    Google Scholar 

  3. C. Berge,The theory of graphs and its applications (Methuen, London, 1962).

    Google Scholar 

  4. V. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques-238, Université de Montréal (October 1972).

  5. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems”,Discrete Mathematics 5 (1973) 305–337.

    Google Scholar 

  6. J. Edmonds, “Covers and packings in a family of sets”,Bulletin of the American Mathematical Society 68 (1962) 494–499.

    Google Scholar 

  7. J. Edmonds, “Paths, trees, and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.

    Google Scholar 

  8. L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).

    Google Scholar 

  9. D.R. Fulkerson, “Anti-blocking polyhedra”,Journal of Combinatorial Theory 12 (1972) 50–71.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. A.M. Geoffrion, “An improved implicit enumeration approach for integer programming”,Operations Research 17 (1969) 437–454.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. G.L. Nemhauser and L.E. Trotter, Jr., “Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61.

    Google Scholar 

  15. M. Padberg, “On the facial structure of set packing polyhedra”,Mathematical programming 5 (1973) 199–216.

    Google Scholar 

  16. R. Tarjan, “Finding a maximum clique”, Tech. Rept. 72-123, Dept. of Computer Science, Cornell University, Ithaca, N.Y. (March 1972).

    Google Scholar 

  17. 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).

    Google Scholar 

  18. 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).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported by National Science Foundation Grant GK-32282X to Cornell University.

Work done at Cornell University, Yale University and the Mathematics Research Center of the University of Wisconsin under National Science Foundation Grants GK-32282X and GK-42095 and U.S. Army Contract No. DA-31-124-ARO-D-462, respectively.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nemhauser, G.L., Trotter, L.E. Vertex packings: Structural properties and algorithms. Mathematical Programming 8, 232–248 (1975). https://doi.org/10.1007/BF01580444

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580444

Keywords

Navigation