Bettina, Klinz and Scutellà, Maria Grazia (1999) A strongly polynomial algorithm for the Balanced network flow problem. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
![[img]](http://eprints.adm.unipi.it/style/images/fileicons/application_postscript.png) | Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (63Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-99-17.ps.g...
Abstract
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of finding a feasible flow on a given network which minimizes the difference between the maximum and the minimum weighted flow on single arcs, can be solved in strongly polynomial time. The proposed solution algorithm consists of extending Megiddo's approach for parametric programming.
| Item Type: | Book |
|---|---|
| Uncontrolled Keywords: | Balanced flows, parametric programming |
| Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
| Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
| Depositing User: | dott.ssa Sandra Faita |
| Date Deposited: | 27 Jan 2015 09:53 |
| Last Modified: | 27 Jan 2015 09:53 |
| URI: | http://eprints.adm.unipi.it/id/eprint/2019 |
Repository staff only actions
| View Item |
