A combinatorial approximation algorithm for concurrent flow problem and its application

DOI10.1016/j.cor.2003.09.010zbMath1071.90036OpenAlexW1989177948MaRDI QIDQ707017

Suh-Wen Chiou

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.010

zbMATH Keywords

Combinatorial algorithmConcurrent flow problemMinimum-cost flow

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Bounds on maximum concurrent flow in random bipartite graphs

Uses Software

• LEDA
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A natural randomization strategy for multicommodity flow and related algorithms
• Fast deterministic approximation for the multicommodity flow problem
• Fast approximation algorithms for multicommodity flow problems
• Optimization of Area Traffic Control for Equilibrium Network Flows
• Finding Minimum-Cost Circulations by Successive Approximation
• The maximum concurrent flow problem
• Using separation algorithms in fixed dimension
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

This page was built for publication: A combinatorial approximation algorithm for concurrent flow problem and its application