𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the maximum capacity augmentation algorithm for the maximum flow problem

✍ Scribed by Donald Goldfarb; Jianxiu Hao

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
489 KB
Volume
47
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A capacity scaling algorithm for the con
A capacity scaling algorithm for the constrained maximum flow problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of