Show simple item record

dc.contributor.authorTardos, E.en_US
dc.contributor.authorOrlin, J. B.en_US
dc.contributor.authorPlotkin, S.en_US
dc.date.accessioned2007-11-09T20:08:24Z
dc.date.available2007-11-09T20:08:24Z
dc.date.issued1992-02en_US
dc.identifier.citation998en_US
dc.identifier.urihttps://hdl.handle.net/1813/8883
dc.description.abstractThis paper published in the "Proc. of the Thirty-second IEEE Symp. on Foundations of Computer Science" (1991), 495-504.en_US
dc.format.extent3302893 bytes
dc.format.mimetypeapplication/pdf
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.titlePolynomial dual network simplex algorithmsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics