A capacity scaling algorithm for the constrained maximum flow problem

DOI10.1002/net.3230250207zbMath0821.90041OpenAlexW1970952976MaRDI QIDQ4698231

Ravindra K. Ahuja, James B. Orlin

Publication date: 27 September 1995

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

capacity scaling algorithmsconstrained maximum flow

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items

Efficient algorithms for robustness in resource allocation and scheduling problems, Budget-constrained minimum cost flows, Efficient contraflow algorithms for quickest evacuation planning, Integer programming techniques for solving non-linear workforce planning models with learning, A capable neural network model for solving the maximum flow problem, A new scaling algorithm for the minimum cost network flow problem, A double scaling algorithm for the constrained 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, Bottleneck Capacity Expansion Problems with General Budget Constraints, On a capacity scaling algorithm for the constrained maximum flow problem, Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity

Cites Work

• Solving integer minimum cost flows with separable convex cost objective polynomially