Bounds for global optimization of capacity expansion and flow assignment problems

DOI10.1016/S0167-6377(00)00027-4zbMath0960.90055OpenAlexW2052092601WikidataQ127526517 ScholiaQ127526517MaRDI QIDQ1591547

Philippe Mahey, Henrigue Pacca Loureiro Luna

Publication date: 20 December 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00027-4

zbMATH Keywords

network designcapacity expansion of telecommunication systemsnonconvex multicommodity flow problemseparable convexification

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (4)

Local optimality conditions for multicommodity flow problems with separable piecewise convex costs ⋮ Tree network design avoiding congestion ⋮ Separable convexification and DCA techniques for capacity and flow assignment problems ⋮ A conic quadratic formulation for a class of convex congestion functions in network flow problems

Cites Work

• Unnamed Item
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• Optimization on low rank nonconvex structures
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• The flow deviation method: An approach to store‐and‐forward communication network design
• Lagrange Multipliers and Nonconvex Programs
• Convex separable optimization is not much harder than linear optimization

This page was built for publication: Bounds for global optimization of capacity expansion and flow assignment problems