On the complexity of preflow-push algorithms for maximum flow problems
| dc.contributor.author | Tuncel, L. | en_US |
| dc.date.accessioned | 2007-11-09T20:00:56Z | |
| dc.date.available | 2007-11-09T20:00:56Z | |
| dc.date.issued | 1990-04 | en_US |
| dc.description.abstract | On the complexity of preflow-push algorithms for maximum flow problems | en_US |
| dc.format.extent | 1086095 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | 901 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/8784 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University Operations Research and Industrial Engineering | en_US |
| dc.subject | Operations Research | en_US |
| dc.subject | Industrial Engineering | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the complexity of preflow-push algorithms for maximum flow problems | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1