Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems

DOI10.1287/IJOC.15.4.369.24887zbMATH Open1238.90022OpenAlexW2166295802WikidataQ118165509 ScholiaQ118165509MaRDI QIDQ2884565FDOQ2884565

Authors: Paola Cappanera, Antonio Frangioni 

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.15.4.369.24887

Recommendations

• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Alternating direction splittings for block angular parallel optimization
• A Parallel Projection for the Multicommodity Network Model

zbMATH Keywords

large-scale systemsnon-differentiable programmingmulticommodity programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (3)

• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• Multicommodity network flows: A survey. II: Solution methods

Uses Software

• IPM

This page was built for publication: Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems

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