Bounds for global optimization of capacity expansion and flow assignment problems

DOI10.1016/S0167-6377(00)00027-4MaRDI QIDQ1591547zbMATH OpenOpenAlexWikidataFDO

Authors Philippe Mahey, Henrique 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

capacity expansion of telecommunication systemsnetwork designnonconvex multicommodity flow problemseparable convexification

Mathematics Subject Classification ID

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

Recommendations

• LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
• Optimization in telecommunication networks
• Multicommodity network expansion under elastic demands
• scientific article; zbMATH DE number 4149863
• Separable convexification and DCA techniques for capacity and flow assignment problems.

Cites work

• A survey of algorithms for convex multicommodity flow problems
• Convex separable optimization is not much harder than linear optimization
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• Lagrange Multipliers and Nonconvex Programs
• Optimization on low rank nonconvex structures
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• The flow deviation method: An approach to store‐and‐forward communication network design

Cited in

(7)

• Relief period optimization under budget constraints
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• scientific article; zbMATH DE number 611144 (Why is no real title available?)
• Tree network design avoiding congestion
• A conic quadratic formulation for a class of convex congestion functions in network flow problems
• Uncapacitated flow-based extended formulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591547)