Opening book details…
Can I read A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem on EtoBox?
A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem by Maria Grazia Scutellá is a Computer Science article available to read on EtoBox.
What is A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem about?
## 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 Radzik's analysis of Newton's method for linear fractional combinatorial optimization problems.
Who reads A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Maria Grazia Scutellá
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 1998
- Language
- EN
- Field
- Computer Science (Physical Sciences)