On a capacity scaling algorithm for the constrained maximum flow problem

DOI10.1002/NET.20263MaRDI QIDQ5191144zbMATH OpenOpenAlexFDO

Authors Cenk Çalışkan

Publication date 28 July 2009

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

maximum flowpolynomial algorithmminimum cost network flowcapacity scaling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• A capacity scaling algorithm for the constrained maximum flow problem
• On the maximum capacity augmentation algorithm for the maximum flow problem
• A faster polynomial algorithm for the constrained maximum flow problem
• A specialized network simplex algorithm for the constrained maximum flow problem
• A double scaling algorithm for the constrained maximum flow problem

Cites work

• A capacity scaling algorithm for the constrained maximum flow problem

Cited in

(11)

• 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
• A capacity scaling algorithm for the constrained maximum flow problem
• 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 linear time algorithm for the maximum capacity path problem
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• A capable neural network model for solving the maximum flow problem
• scientific article; zbMATH DE number 611144 (Why is no real title available?)

This page was built for publication: On 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 Q5191144)