A double scaling algorithm for the constrained maximum flow problem

DOI10.1016/J.COR.2006.07.009MaRDI QIDQ941539zbMATH OpenOpenAlexFDO

Authors Cenk Çalışkan

Publication date 1 September 2008

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

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

zbMATH Keywords

minimum cost network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• A faster polynomial algorithm for the constrained maximum flow problem
• A capacity scaling algorithm for the constrained maximum flow problem
• A network simplex method for the budget-constrained minimum cost flow problem
• A specialized network simplex algorithm for the constrained maximum flow problem
• Finding minimum-cost flows by double scaling

Cites work

• A capacity scaling algorithm for the constrained maximum flow problem
• A note on two problems in connexion with graphs
• A priority queue in which initialization and queue operations takeO(loglogD) time
• A strongly polynomial minimum cost circulation algorithm
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
• Faster algorithms for the shortest path problem
• Finding Minimum-Cost Circulations by Successive Approximation
• Finding minimum-cost flows by double scaling
• scientific article; zbMATH DE number 1670814 (Why is no real title available?)
• Integer priority queues with decrease key in constant time and the single source shortest paths problem
• Network flows. Theory, algorithms, and applications.
• On RAM Priority Queues
• Priority queues: small, monotone and trans-dichotomous

Cited in

(8)

• A network simplex method for the budget-constrained minimum cost flow problem
• A faster polynomial algorithm for the constrained maximum flow problem
• A capable neural network model for solving the maximum flow problem
• Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
• A capacity scaling algorithm for the constrained maximum flow problem
• On a capacity scaling algorithm for the constrained maximum flow problem
• A specialized network simplex algorithm for the constrained maximum flow problem
• A generalized approximation framework for fractional network flow and packing problems

This page was built for publication: A double scaling algorithm for the constrained maximum flow problem

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