On a capacity scaling algorithm for the constrained maximum flow problem

Authors:
Cenk Çalışkan
Affiliations:
Department of Business Administration, University of Delaware, Newark, Delaware 19716
Venue:
Networks
Year:
2009

Citing 0
Cited 2

A faster polynomial algorithm for the constrained maximum flow problem

Computers and Operations Research
A capable neural network model for solving the maximum flow problem

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ahuja and Orlin (Networks 25 (1995), 89–98) introduced a constrained maximum flow problem and proposed its first polynomial combinatorial algorithm. The problem has important applications and is related to important problems such as the knapsack problem. In this article, we show that the algorithm may not terminate with a feasible solution in certain instances and provide a modified version with the same complexity. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009