𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new strongly polynomial dual network simplex algorithm

✍ Scribed by Ronald D. Armstrong; Zhiying Jin

Book ID
110591387
Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
909 KB
Volume
78
Category
Article
ISSN
0025-5610

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

Balanced network flows. III. Strongly po
Balanced network flows. III. Strongly polynomial augmentation algorithms
✍ Fremuth-Paeger, Christian; Jungnickel, Dieter πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

We discuss efficient augmentation algorithms for the maximum balanced flow problem which run in O(nm 2 ) time. More explicitly, we discuss a balanced network search procedure which finds valid augmenting paths of minimum length in linear time. The algorithms are based on the famous cardinality match