Separable convexification and DCA techniques for capacity and flow assignment problems

DOI10.1051/ro:2001114zbMath1048.90047OpenAlexW2022483727MaRDI QIDQ2773173

Philippe Mahey, Henrigue Pacca Loureiro Luna, Thai Quynh Phong

Publication date: 2001

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_2_269_0

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

DC programming and DCA: thirty years of developments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for network dimensioning under reliability considerations
• Optimization on low rank nonconvex structures
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Bounds for global optimization of capacity expansion and flow assignment problems
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• A composite algorithm for a concave-cost network flow problem
• Backbone Network Design Tools with Economic Tradeoffs
• A new proximal decomposition algorithm for routing in telecommunication networks
• The flow deviation method: An approach to store‐and‐forward communication network design
• Lagrange Multipliers and Nonconvex Programs
• Capacity and flow assignment of data networks by generalized Benders decomposition