Bounds for global optimization of capacity expansion and flow assignment problems

  title={Bounds for global optimization of capacity expansion and flow assignment problems},
  author={Henrique Pacca Loureiro Luna and P. Mahey},
  journal={Oper. Res. Lett.},
This paper provides new bounds related to the global optimization of the problem of mixed routing and bandwidth allocation in telecommunication systems. The combinatorial nature of the problem, related to arc expansion decisions, is embedded in a continuous objective function that encompasses congestion and investment line costs. It results in a non-convex multicommodity ow problem, but we explore the separability of the objective function and the fact that each associated arc cost function is… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 12 references

Data Networks

  • D. P. Bertsekas, R. G. Gallager
  • Prentice-Hall, Englewood Cli s, NJ
  • 1987
Highly Influential
3 Excerpts

A survey of algorithms for convex multicommodity ow problems

  • A. Ouorou, P. Mahey, J. P. Vial
  • Working paper 1997-13, HEC, Universit e de Gen…
  • 2000
1 Excerpt

Optimization on Low Rank Nonconvex Structures

  • H. Konno, P. T. Thach, H. Tuy
  • Kluwer Academic Publishers, Dordrecht
  • 1997


  • J. B. Hiriart-Urruty
  • Lemar echal, Convex Analysis and Minimization…
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…