Progress Made in Solving the Multicommodity Flow Problem

DOI10.1137/S1052623496304542zbMath0912.90128OpenAlexW1990452201MaRDI QIDQ4229456

Richard D. McBride

Publication date: 22 February 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623496304542

zbMATH Keywords

transportationmulticommoditypartitioned inverse

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (9)

Large-scale optimization with the primal-dual column generation method ⋮ Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ Unnamed Item ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ The simplex algorithm for multicommodity networks ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems ⋮ About Lagrangian methods in integer optimization

Uses Software

• KORBX
• PPRN

This page was built for publication: Progress Made in Solving the Multicommodity Flow Problem