A polyhedral study of the generalized vertex packing problem

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.

[1]  Hanif D. Sherali,et al.  An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations , 2002, Transp. Sci..

[2]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[3]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[4]  Hanif D. Sherali,et al.  Persistency in 0-1 Polynomial Programming , 1998, Math. Oper. Res..

[5]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[6]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[7]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[8]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[9]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[10]  L. A. Wolsey,et al.  Further facet generating procedures for vertex packing polytopes , 1976, Math. Program..

[11]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

[12]  J. C. Picard,et al.  On the integer-valued variables in the linear vertex packing problem , 1977, Math. Program..

[13]  Hanif D. Sherali,et al.  Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems , 1998, Oper. Res..

[14]  Antonio A Trani,et al.  National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm , 2000, Transp. Sci..

[15]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[18]  Alexander Schrijver,et al.  Relaxations of vertex packing , 1986, J. Comb. Theory B.

[19]  Leslie E. Trotter,et al.  A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..

[20]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[21]  Panos M. Pardalos,et al.  A branch and bound algorithm for the maximum clique problem , 1992, Comput. Oper. Res..