A scaling algorithm for multicommodity flow problems

DOI10.1287/OPRE.46.2.231MaRDI QIDQ2781151zbMATH OpenOpenAlexFDO

Authors Rina R. Schneur, James B. Orlin

Publication date 31 July 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/48995

zbMATH Keywords

\(\varepsilon\)-optimal solutionmulticommodity flowpenalty-based algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 515936
• Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
• Fast approximation algorithms for multicommodity flow problems
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• scientific article; zbMATH DE number 176478

Cited in

(9)

• An augmented Lagrangian algorithm for large scale multicommodity routing
• Speeding up Karmarkar's algorithm for multicommodity flows
• Network design and flow problems with cross-arc costs
• Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
• Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
• An affine scaling method for solving network flow problems
• Multicommodity network flows: A survey. II: Solution methods
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• A survey of very large-scale neighborhood search techniques

This page was built for publication: A scaling algorithm for multicommodity flow problems

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