A combinatorial approximation algorithm for concurrent flow problem and its application

DOI10.1016/J.COR.2003.09.010MaRDI QIDQ707017zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Combinatorial approximation algorithms for generalized flow problems
• Approximation algorithms and hardness of integral concurrent flow
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• Efficient algorithms for the maximum concurrent flow problem
• Approximation and Online Algorithms
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• scientific article; zbMATH DE number 108290
• Approximation algorithms for the parallel flow shop problem

Cites work

• scientific article; zbMATH DE number 1187163 (Why is no real title available?)
• scientific article; zbMATH DE number 515936 (Why is no real title available?)
• A natural randomization strategy for multicommodity flow and related algorithms
• Fast approximation algorithms for multicommodity flow problems
• Fast deterministic approximation for the multicommodity flow problem
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• Finding Minimum-Cost Circulations by Successive Approximation
• Network flows. Theory, algorithms, and applications.
• Optimization of area traffic control for equilibrium network flows
• The maximum concurrent flow problem
• Using separation algorithms in fixed dimension

Cited in

(10)

• Combinatorial approximation algorithms for generalized flow problems
• Bounds on maximum concurrent flow in random bipartite graphs
• Combinatorial approaches to multiflow problems
• A combinatorial approximation algorithm for supply chain network flow problem
• Max concurrent flow problem
• scientific article; zbMATH DE number 6861895 (Why is no real title available?)
• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Meet and merge: approximation algorithms for confluent flows
• The maximum concurrent flow problem
• Efficient algorithms for the maximum concurrent flow problem

Describes a project that uses

Uses Software

• CPLEX
• LEDA

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

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