𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow

✍ Scribed by Bauguion, Pierre-Olivier; Ben-Ameur, Walid; Gourdin, Eric

Book ID
121475084
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
211 KB
Volume
41
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A strongly polynomial algorithm for the
A strongly polynomial algorithm for the uniform balanced network flow problem
✍ Maria Grazia ScutellΓ‘ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 565 KB

## Several balanced optimization problems have been analysed in the literature. Here, the balanced network flow problem in the uniform case is studied, and it is shown that it can be solved by the Newton's approach in O(n' log3 n) max-flow computations. The key of the proof is an extension of Rad