Skip to main content
SpringerLink
Log in

A polyhedral study of the generalized vertex packing problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

The traditional vertex packing problem defined on an undirected graph identifies the largest weighted independent set of nodes, that is, a set of nodes whose induced subgraph contains no edges. In this paper, we examine a generalized vertex packing problem (GVP-k) in which k ``violations'' to the independent set restriction are permitted, whereby k edges may exist within the subgraph induced by the chosen set of nodes. A particular context in which such problems arise is in the national airspace planning model of Sherali, Smith, and Trani (2000), where a set of flight-plans need to be composed for various flights subject to conflict, workload, and equity considerations. The GVP-k structure arises in modeling the air-traffic control sector workload restrictions, which stipulate that for each sector and during each discretized time-slot, the number of aircraft conflicts that would need to be resolved should not exceed k, for some k≥1. We derive several classes of facetial valid inequalities for GVP-k for certain specially structured subgraphs, identifying polynomial-sized convex hull representations for some of these cases. Related constraint generation routines are also developed, and some computational results are provided to demonstrate the efficacy of utilizing the proposed valid inequalities in solving GVP-k for different values of k.

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

Access this article

Log in via an institution

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. Adams, W.P., Lassiter, J.B., Sherali, H.D.: Persistency in 0-1 polynomial programming. Math. Oper. Res. 23 (2), 359–389 (1998)

    Google Scholar 

  2. Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. John Wiley & Sons, second edition, New York, NY, 1990

  3. Chvátal, V.: On certain polytopes associated with graphs. J. Comb. Theory, Series B 18, 138–154 (1982)

    Article  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, NY, 1979

  5. Grötschel, M., Lovász, L., Schrijver, A.: Relaxations of vertex packing. J. Comb. Theory, Series B 40, 330–343 (1986)

    Article  MATH  Google Scholar 

  6. Kruskal, J.B.: On the shortest spanning tree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48–50 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nemhauser, G.L., Trotter, L.E.: Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48–61 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  8. Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8, 232–248 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, New York, NY, 1988

  10. Pardalos, P.M., Rodgers, G.P.: A branch and bound algorithm for the maximum clique problem. Comput. Oper. Res. 19, 363–375 (1992)

    Article  MATH  Google Scholar 

  11. Picard, J.-C., Queyranne, M.: On the integer-valued variables in the linear vertex packing problem. Math. Program. 12, 97–101 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math. 3, 411–430 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Disc. Appl. Math. 52, 83–106 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sherali, H.D., Adams, W.P., Driscoll, P.: Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper. Res. 46, 396–405 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sherali, H.D., Smith, J.C., Trani, A.A.: An airspace planning model for selecting flight-plans under workload, safety, and equity considerations. To appear in Transportation Science, 2000

  16. Sherali, H.D., Smith, J.C., Trani, A.A., Sale, S.: National airspace sector occupancy and conflict analysis models for evaluating scenarios under the free-flight paradigm. Trans. Sci. 34, 321–336 (2000)

    Article  MATH  Google Scholar 

  17. Trotter, L.E., Jr: A class of facet producing graphs for vertex packing polyhedra. Disc. Math. 12, 373–388 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  18. Wolsey, L.A.: Further facet generating procedures for vertex packing polytopes. Math. Program. 11, 158–163 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Hanif D. Sherali

  2. Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 85721, USA

    J. Cole Smith

Authors
  1. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Cole Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Cole Smith.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sherali, H., Cole Smith, J. A polyhedral study of the generalized vertex packing problem. Math. Program. 107, 367–390 (2006). https://doi.org/10.1007/s10107-004-0504-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-004-0504-0

Keywords

Search

Navigation