Show simple item record

dc.contributorBertsekas, Dimitri P.en_US
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.en_US
dc.date.accessioned2003-04-29T15:38:01Z
dc.date.available2003-04-29T15:38:01Z
dc.date.issued1992en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/3292
dc.descriptionIncludes bibliographical references (p. 16-17).en_US
dc.description.sponsorshipSupported by the NSF. CCR-9103804 Supported by the ARO. DAAL03-92-G-0115en_US
dc.description.statementofresponsibilityby Dimitri P. Bertsekas.en_US
dc.format.extent17 p.en_US
dc.format.extent1078831 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems]en_US
dc.relation.ispartofseriesLIDS-P ; 2147en_US
dc.subject.lccTK7855.M41 E3845 no.2147en_US
dc.titleMathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flowen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record