Show simple item record

dc.contributorBertsekas, Dimitri P.en_US
dc.contributorPolymenakos, Lazaros.en_US
dc.contributorTseng, Paul.en_US
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.en_US
dc.date.accessioned2003-04-29T15:42:30Z
dc.date.available2003-04-29T15:42:30Z
dc.date.issued1996en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/3438
dc.descriptionCaption title.en_US
dc.descriptionIncludes bibliographical references (p. 19-21).en_US
dc.description.sponsorshipSupported by the NSF. CCR-9103804 9300494-DMIen_US
dc.description.statementofresponsibilityby Dimitri P. Bertsekas, Lazaros C. Polymenakos and Paul Tseng.en_US
dc.format.extent21, iii p.en_US
dc.format.extent1985457 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systemsen_US
dc.relation.ispartofseriesLIDS-P ; 2367en_US
dc.subject.lccTK7855.M41 E3845 no.2367en_US
dc.titleE-relaxation and auction method for separable convex cost network flow problemsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record