Show simple item record

dc.contributorOrlin, James B., 1953-en_US
dc.contributorMassachusetts Institute of Technology. Operations Research Centeren_US
dc.date.accessioned2004-05-28T19:22:10Z
dc.date.available2004-05-28T19:22:10Z
dc.date.issued1988en_US
dc.identifier.otherOR 175-88en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5073
dc.descriptionAlso issued as: Working Paper (Sloan School of Management) ; WP 2042-88en_US
dc.descriptionIncludes bibliographical references (leaf 11).en_US
dc.description.sponsorshipSupported by a National Science Foundation Presidential Young Investigator Grant. 8451517-ECS Supported by the Air Force Office of Scientific Research, Analog Devices, Apple Computer, and Prime Computer.en_US
dc.description.statementofresponsibilityby James B. Orlin.en_US
dc.format.extent11 leavesen_US
dc.format.extent1368245 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesWorking paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 175-88. Working paper (Sloan School of Management) ; 2042-88.en_US
dc.subject.lccQ175.M41 O616 no.175-88en_US
dc.titleA faster strongly polynomial minimum cost flow algorithmen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record