Skip to main content
SpringerLink
Log in

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

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. R. Ahuja, T.K. Magnanti and J.B. Orlin, Networks Flows, Algorithms and Applications (Prentice–Hall, 1993).

  2. A.A. Assad, Multicommodity network flows–a survey, Networks 8 (1978) 37–91.

    Google Scholar 

  3. A. Balakrishnan, T.L. Magnanti and P. Mirchandani, Network design, in: Automated Bibliographies in Combinatorial Optimization, eds. M. Dell'Amico, F. Maffioli and S. Martello (Wiley, 1998).

  4. F. Barahona, Network design using cut inequalities, SIAM Journal on Optimization 6(3) (1996) 823–837.

    Google Scholar 

  5. J.F. Benders, Partitioning procedures for solving mixed–variable programming problems, Numer. Math. 4 (1962) 238–252.

    Google Scholar 

  6. D. Bienstock and O. Günlük, Capacitated network design–polyhedral structure and computation, INFORMS Journal on Computing (1996) 243–259.

  7. D. Bienstock, S. Chopra, O. Günlük and C.Y. Tsai, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming 81 (1998) 177–199.

    Google Scholar 

  8. D. Bienstock and G. Muratore, Strong inequalities for capacitated survivable network design problems, Math. Programming Ser. A 89 (2000) 127–147.

    Google Scholar 

  9. S.C. Boyd and T. Hao, An integer polytope related to the design of survivable communication networks, SIAM Journal of Discrete Math. 6(4) (1993) 612–630.

    Google Scholar 

  10. S. Chopra, I. Gilboa and S. Trilochan–Sastry, Algorithms and extended formulations for one and two facility network design, in: Proceedings 5th IPCO Conf., Lecture Notes in Computer Science (1996) pp. 44–57.

  11. G. Dahl and M. Stoer, A cutting–plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10(1) (1998).

  12. L.R. Ford and D.R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, 1962).

    Google Scholar 

  13. L. Fratta, M. Gerla and L. Kleinrock, The flow–deviation method: an approach to store–and–forward communication network design, Networks 3 (1973) 97–133.

    Google Scholar 

  14. V. Gabrel and M. Minoux, Large scale LP–relaxations for minimum cost multicommodity network flow problems with step–increasing cost functions and computational results, Internal Research Report, MASI 96/17, University Paris 6, France (1996).

    Google Scholar 

  15. V. Gabrel and M. Minoux, LP relaxations better than convexification for multicommodity network optimization problems with step–increasing cost functions, Acta Mathematica Vietnamica 22 (1997) 128–145.

    Google Scholar 

  16. V. Gabrel, A. Knippel and M. Minoux, Exact solution of multicommodity network optimization problems with general step cost functions, Operations Research Letters 25 (1999) 15–23.

    Google Scholar 

  17. V. Gabrel, A. Knippel and M. Minoux, Exact solution of survivable network problems with stepincreasing cost functions, in: ALGOTEL 2 (May 10–12, 2000).

  18. C. Gallo, C. Sandi and C. Sodini, An algorithm for the min concave cost flow problem, European J. Operational Research 4 (1980) 248–255.

    Google Scholar 

  19. B. Gendron, T.G. Crainic and A. Frangioni, Multicommodity capacitated network design, in: Telecommunications Network Planning, eds. B. Sanso and P. Soriano (Kluwer Academic, 1999) pp. 1–19.

  20. G. Geoffrion and G. Graves, Multicommodity distribution system design by Benders decomposition, Management Science 5 (1974) 822–844.

    Google Scholar 

  21. M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Trans. Comput. COM–25 (1977) 48–60.

    Google Scholar 

  22. M. Goemans and D. Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Mathematical Programming 60(2) (1993) 145–166.

    Google Scholar 

  23. R.E. Gomory and T.C. Hu, An application of generalized linear programming to network flows, SIAM J. Appl. Math. 10 (1962) 260–283.

    Google Scholar 

  24. M. Gondran and M. Minoux, Graphs and Algorithms (Wiley, New York, 1984).

    Google Scholar 

  25. M. Grötschel and C. Monma, Integer polyhedron associated with certain network design problems with connectivity constraints, SIAM J. Discrete Math. 3 (1990) 502–523.

    Google Scholar 

  26. M. Grötschel, C. Monma and M. Stoer, Computational results with a cutting–plane algorithm for designing communication networks with low connectivity constraints, Operations Research 40 (1992) 309–330.

    Google Scholar 

  27. M. Grötschel, C. Monma and M. Stoer, Design of survivable networks, in: Handbook in OR and MS, Vol. 7 (1995) pp. 617–672.

    Google Scholar 

  28. O. Günlük, A branch–and–cut algorithm for capacitated network design problems, Math. Programming Ser. A 86 (1999) 17–39.

    Google Scholar 

  29. H.H. Hoang, Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition, IEEE Trans. Automatic Control AC–27 (1982) 164–169.

    Google Scholar 

  30. J. Kennington, Multicommodity flows: A state–of–the art survey of linear models and solution techniques, Operations Research 26 (1978) 209–236.

    Google Scholar 

  31. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst. Techn. J. 49(2) (1970) 291–307.

    Google Scholar 

  32. T.L. Magnanti and P. Mirchandani, Shortest paths, single origin–destination network design and associated polyhedra, Networks 33 (1993) 103–121.

    Google Scholar 

  33. T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the capacitated network loading problem, Working Paper #709, KATZ graduate School of Business, University of Pittsburgh, PA (1991).

    Google Scholar 

  34. T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two–facility capacitated network loading problem, Operations Research 43(1) (1995) 142–157.

    Google Scholar 

  35. T.L. Magnanti, P. Mireault and R.T. Wong, Tailoring Benders decomposition for uncapacitated network design, Mathematical Programming Study 26 (1986) 112–154.

    Google Scholar 

  36. T.L. Magnanti and R.T. Wong, Network design and transportation planning–models and algorithms, Transportation Science 18 (1984) 1–55.

    Google Scholar 

  37. T.L. Magnanti and R.T. Wong, A dual ascent approach to fixed charge network design problems (1999) to appear.

  38. M. Minoux, Optimisation et planification des réseaux de télécommunications, in: Optimization Techniques, eds. G. Goos, J. Hartmanis and J. Cea, Lecture Notes in Computer Science 40 (Springer, 1976) pp. 419–430.

  39. M. Minoux, Optimum synthesis of a network with non–simultaneous multicommodity flow requirements, in: Studies on Graphs and Discrete Programming, ed. P. Hansen, Annals of Discrete Mathematics 11 (1981) pp. 269–277.

  40. M. Minoux, Subgradient optimization and Benders decomposition for large scale programming, in: Mathematical Programming, eds. R.W. Cottle, M.L. Kelmanson and B. Korte (1984) pp. 271–288.

  41. M. Minoux, Network synthesis and dynamic network optimization, in: Surveys in Combinational Optimization, eds. S. Martello, G. Laporte, M. Minoux and C. Ribeiro, Annals of Discrete Mathematics 31 (1986) pp. 283–324.

  42. M. Minoux, Mathematical Programming. Theory and Algorithms (Wiley, 1986).

  43. M. Minoux, Network synthesis and optimum network design problems: Models, solution methods and applications, Networks 19 (1989) 313–360.

    Google Scholar 

  44. M. Minoux and J.Y. Serreault, Subgradient optimization and large scale programming: an application to network synthesis with security constraints, RAIRO 15 (1984) 185–203.

    Google Scholar 

  45. P.M. Mirchandani, Polyhedral Structure of a Capacitated Network Design Problem with an Application to the Telecommunication Industry, Ph.D. dissertation (MIT Press, Cambridge, MA, 1989).

    Google Scholar 

  46. C. Monma and D. Shallcross, Methods for designing communication networks with certain twoconnected survivability constraints, Operations Research 37 (1989) 531–541.

    Google Scholar 

  47. G.L. Nemhauser and L.A.Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).

    Google Scholar 

  48. A. Onaga and O. Kakusho, On feasibility conditions of multicommodity flows in networks, IEEE Trans. on Circuit Theory CT 18 (1971) 425–429.

    Google Scholar 

  49. A. Ouorou, Décomposition proximale des problèmes de multiflots à critère convexe. Application aux problèmes de routage dans les réseaux de communication, Thèse de Doctorat, Université de Clermont–Ferrand (1995).

  50. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Algorithms and Complexity (Prentice–Hall, 1982).

  51. M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik 68 (1994) 149–167.

    Google Scholar 

  52. L.A. Wolsey, Valid inequalities for 0–1 knapsacks and MIPS with generalized upper bound constraints, Discrete Appl. Math. 29 (1990) 251–261.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Paris 6, 4, place Jussieu, 75005, Paris, France

    Michel Minoux

Authors
  1. Michel Minoux
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minoux, M. Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods. Annals of Operations Research 106, 19–46 (2001). https://doi.org/10.1023/A:1014554606793

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014554606793

Keywords

Search

Navigation