A branch-and-cut algorithm for capacitated network design problems

Abstract.We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traffic demands, the objective is to install more capacity on the edges of the network and route traffic simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet defining inequalities. These inequalities, together with other known combinatorial and mixed-integer rounding inequalities, are used as cutting planes. To choose the branching variable, we use a new rule called “knapsack branching”. We also report on our computational experience using real-life data.

[1]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[2]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[3]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[4]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

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

[6]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[7]  John A. Tomlin,et al.  Technical Note - An Improved Branch-and-Bound Method for Integer Programming , 1971, Oper. Res..

[8]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..

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

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

[11]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

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

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

[14]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[15]  Norman J. Driebeek.  An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .

[16]  Geir Dahl,et al.  Routing Through Virtual Paths in Layered Telecommunication Networks , 1999, Oper. Res..

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

[18]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

[19]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[20]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[21]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[22]  G. Nemhauser,et al.  Integer Programming , 2020 .

[23]  Martin W. P. Savelsbergh,et al.  A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..