A new proximal decomposition algorithm for routing in telecommunication networks

DOI<227::AID-NET3>3.0.CO;2-F 10.1002/(SICI)1097-0037(199807)31:4<227::AID-NET3>3.0.CO;2-FzbMath1015.90020OpenAlexW1974650454MaRDI QIDQ4542490

Jerome Chifflet, Adam Ouorou, Philippe Mahey, Larry J. Le Blanc

Publication date: 11 August 2003

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<227::aid-net3>3.0.co;2-f

zbMATH Keywords

telecommunication networksdecomposition algorithm

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Decomposition methods (49M27)

Related Items (15)

Multiple allocation hub-and-spoke network design under hub congestion ⋮ A bundle-type algorithm for routing in telecommunication data networks ⋮ The proximal Chebychev center cutting plane algorithm for convex additive functions ⋮ A survey on operator splitting and decomposition of convex programs ⋮ Convergence rate of a proximal multiplier algorithm for separable convex minimization ⋮ Modified Lagrangian methods for separable optimization problems ⋮ Unnamed Item ⋮ A minimum mean cycle cancelling method for nonlinear multicommodity flow problems ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Separable convexification and DCA techniques for capacity and flow assignment problems ⋮ A proximal multiplier method for separable convex minimization ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems ⋮ FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION

This page was built for publication: A new proximal decomposition algorithm for routing in telecommunication networks