A capacity scaling algorithm for the constrained maximum flow problem

DOI10.1002/NET.3230250207zbMATH Open0821.90041OpenAlexW1970952976MaRDI QIDQ4698231FDOQ4698231

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

Recommendations

• On a capacity scaling algorithm for the constrained maximum flow problem
• A computational study of the capacity scaling algorithm for the maximum flow problem
• A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
• A double scaling algorithm for the constrained maximum flow problem
• On the maximum capacity augmentation algorithm for the maximum flow problem
• A generalization of the scaling max-flow algorithm
• Capacity scaling algorithm for scalable M-convex submodular flow problems
• A capacity scaling algorithm for convex cost submodular flows
• A capacity scaling algorithm for M-convex submodular flow
• Integer Programming and Combinatorial Optimization

zbMATH Keywords

capacity scaling algorithmsconstrained maximum flow

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• A generalized approximation framework for fractional network flow and packing problems
• Capacitated Confluent Flows: Complexity and Algorithms
• Capacity-filtering algorithms for finite-capacity planning of a flexible flow line
• Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity
• On a capacity scaling algorithm for the constrained maximum flow problem
• Budget-constrained minimum cost flows
• A specialized network simplex algorithm for the constrained maximum flow problem
• A faster polynomial algorithm for the constrained maximum flow problem
• A network simplex method for the budget-constrained minimum cost flow problem
• A double scaling algorithm for the constrained maximum flow problem
• A generalization of the scaling max-flow algorithm
• A linear time algorithm for the maximum capacity path problem
• Bottleneck capacity expansion problems with general budget constraints
• Efficient contraflow algorithms for quickest evacuation planning
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• Title not available (Why is that?)
• A capable neural network model for solving the maximum flow problem
• Integer programming techniques for solving non-linear workforce planning models with learning
• Title not available (Why is that?)
• A new scaling algorithm for the minimum cost network flow problem
• Efficient algorithms for robustness in resource allocation and scheduling problems

This page was built for publication: A capacity 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 Q4698231)