A double scaling algorithm for the constrained maximum flow problem

DOI10.1016/j.cor.2006.07.009zbMath1172.90328OpenAlexW2089627205MaRDI QIDQ941539

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)

Related Items (5)

A capable neural network model for solving the maximum flow problem ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ A faster polynomial algorithm for the constrained maximum flow problem

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A strongly polynomial minimum cost circulation algorithm
• Finding minimum-cost flows by double scaling
• Finding Minimum-Cost Circulations by Successive Approximation
• Faster algorithms for the shortest path problem
• A priority queue in which initialization and queue operations takeO(loglogD) time
• On RAM Priority Queues
• Priority queues: Small, monotone and trans-dichotomous
• A capacity scaling algorithm for the constrained maximum flow problem
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
• Integer priority queues with decrease key in constant time and the single source shortest paths problem

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