On splittable and unsplittable flow capacitated network design arc–set polyhedra

Abstract.We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separation problem of c–strong inequalities [7] is ??–hard, but can be solved over the subspace of fractional variables only. We introduce two classes of inequalities for the unsplittable flow problems. We present a summary of computational experiments with a branch-and-cut algorithm for multicommodity flow capacitated network design problems to test the effectiveness of the results presented here empirically.

[1]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[2]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[3]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[4]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[5]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Computation , 1998, INFORMS J. Comput..

[6]  Laurence A. Wolsey,et al.  Cutting planes for integer programs with general integer variables , 1998, Math. Program..

[7]  Francisco Barahona,et al.  Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[8]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

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

[10]  Eitan Zemel,et al.  Easily Computable Facets of the Knapsack Polytope , 1989, Math. Oper. Res..

[11]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..

[12]  Martin W. P. Savelsbergh,et al.  Polyhedral results for the edge capacity polytope , 2002, Math. Program..

[13]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[14]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[15]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

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

[17]  L. Wolsey,et al.  Designing Private Line Networks - Polyhedral Analysis and Computation , 1996 .

[18]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[19]  Laurence A. Wolsey,et al.  The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..

[20]  Laurence A. Wolsey,et al.  Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

[21]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[22]  Robert Weismantel,et al.  On the 0/1 knapsack polytope , 1997, Math. Program..

[23]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[24]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

[25]  Thomas L. Magnanti,et al.  Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.

[26]  Laurence A. Wolsey,et al.  bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..

[27]  V. Rich.  Personal communication , 1989, Nature.