eCommons

 

Computational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problem

dc.contributor.authorIkura, Y.en_US
dc.contributor.authorNemhauser, G. L.en_US
dc.date.accessioned2007-11-09T19:07:57Z
dc.date.available2007-11-09T19:07:57Z
dc.date.issued1985-02en_US
dc.description.abstractComputational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problemen_US
dc.format.extent1716456 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation653en_US
dc.identifier.urihttps://hdl.handle.net/1813/8537
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleComputational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problemen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR000653.pdf
Size:
1.64 MB
Format:
Adobe Portable Document Format