Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems

DOI10.1287/ijoc.15.4.369.24887zbMath1238.90022OpenAlexW2166295802WikidataQ118165509 ScholiaQ118165509MaRDI QIDQ2884565

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

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)

Related Items (3)

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Unnamed Item ⋮ Bundle methods for sum-functions with ``easy components: applications to multicommodity network design

Uses Software

• IPM

This page was built for publication: Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems