Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

We first introduce a generic model for discrete cost multicommodity network optimization, together with several variants relevant to telecommunication networks such as: the case where discrete node cost functions (accounting for switching equipment) have to be included in the objective; the case where survivability constraints with respect to single-link and/or single-node failure have to be taken into account. An overview of existing exact solution methods is presented, both for special cases (such as the so-called single-facility and two-facility network loading problems) and for the general case where arbitrary step-increasing link cost-functions are considered. The basic discrete cost multicommodity flow problem (DCMCF) as well as its variant with survivability constraints (DCSMCF) are addressed. Several possible directions for improvement or future investigations are mentioned in the concluding section.

[1]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

[2]  Michel Minoux.  Optimisation et Planification de Réseaux de Télécommunications , 1975, Optimization Techniques.

[3]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

[4]  M. Stoer.  Design of Survivable Networks , 1993 .

[5]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

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

[7]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[8]  Hoang Hai Hoc,et al.  Topological optimization of networks: A nonlinear mixed integer model employing generalized benders , 1980 .

[9]  Itzhak Gilboa,et al.  Algorithms and Extended Formulations for One and Two Facility Network Design , 1996, IPCO.

[10]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[12]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[14]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[15]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

[16]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[17]  Michel Minoux,et al.  Network Synthesis and Dynamic Network Optimization , 1987 .

[18]  Michel Minoux,et al.  Mathematical Programming , 1986 .

[19]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[20]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[21]  J. Herrmann,et al.  A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem , 1996 .

[22]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

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

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

[25]  M. Grötschel,et al.  Chapter 10 Design of survivable networks , 1995 .

[26]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

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

[28]  Adamou Ouorou.  Decomposition proximale des problemes de multiflot a critere convexe. Application aux problemes de routage dans les reseaux de communication , 1995 .

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

[30]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[31]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[32]  Martin Grötschel,et al.  Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..

[33]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[34]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[35]  Daniel Bienstock,et al.  Strong inequalities for capacitated survivable network design problems , 2000, Math. Program..

[36]  Laurence A. Wolsey,et al.  Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..

[37]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[38]  Prakash Mirchandani,et al.  Modeling and Solving the Capacitated Network Loading Problem , 1991 .

[39]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[40]  Prakash Mirchandani.  Polyhedral structure of a capacitated network design problem with an application to the telecommunication industry , 1989 .

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

[42]  M. Minoux,et al.  Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints , 1981 .

[43]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[44]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[45]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[46]  H. Hoc.  Topological optimization of networks: A nonlinear mixed integer model employing generalized benders decomposition , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[47]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .

[48]  Sylvia C. Boyd,et al.  An Integer Polytope Related to the Design of Survivable Communication Networks , 1993, SIAM J. Discret. Math..

[49]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[50]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[51]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[52]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.