Computational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problem
dc.contributor.author | Ikura, Y. | en_US |
dc.contributor.author | Nemhauser, G. L. | en_US |
dc.date.accessioned | 2007-11-09T19:07:57Z | |
dc.date.available | 2007-11-09T19:07:57Z | |
dc.date.issued | 1985-02 | en_US |
dc.description.abstract | Computational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problem | en_US |
dc.format.extent | 1716456 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.citation | 653 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/8537 | |
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 | Computational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problem | en_US |
dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1