Separable convexification and DCA techniques for capacity and flow assignment problems.

DOI10.1051/RO:2001114MaRDI QIDQ2773173zbMATH OpenOpenAlexFDO

Authors Philippe Mahey, Thai Q. Phong, H. P. L. Luna

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, http://www.numdam.org/item?id=RO_2001__35_2_269_0/, https://eudml.org/doc/197823

Mathematics Subject Classification ID

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

Recommendations

• Bounds for global optimization of capacity expansion and flow assignment problems
• Capacitated Confluent Flows: Complexity and Algorithms
• A hybrid algorithm for solving convex separable network flow problems
• A capacity scaling algorithm for the constrained maximum flow problem
• On a capacity scaling algorithm for the constrained maximum flow problem
• A capacity scaling algorithm for convex cost submodular flows
• scientific article; zbMATH DE number 611144
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• On methods for the convex multi-commodity flow problem
• On DC optimization algorithms for solving minmax flow problems

Cites work

• A composite algorithm for a concave-cost network flow problem
• A new proximal decomposition algorithm for routing in telecommunication networks
• 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
• An algorithm for network dimensioning under reliability considerations
• Backbone Network Design Tools with Economic Tradeoffs
• Bounds for global optimization of capacity expansion and flow assignment problems
• Capacity and flow assignment of data networks by generalized Benders decomposition
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 3956839 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• Lagrange Multipliers and Nonconvex Programs
• Optimization on low rank nonconvex structures
• The flow deviation method: An approach to store‐and‐forward communication network design

Cited in

(8)

• Bounds for global optimization of capacity expansion and flow assignment problems
• DC programming and DCA: thirty years of developments
• A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems
• A heuristic for the continuous capacity and flow assignment
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• scientific article; zbMATH DE number 611144 (Why is no real title available?)
• Capacity and flow assignment of data networks by generalized Benders decomposition
• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

This page was built for publication: Separable convexification and DCA techniques for capacity and flow assignment problems.

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