Show simple item record

dc.contributorBertsekas, Dimitri P.en_US
dc.contributorHossein, Patrick Aen_US
dc.contributorTseng, Paul.en_US
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.en_US
dc.date.accessioned2003-04-29T15:26:26Z
dc.date.available2003-04-29T15:26:26Z
dc.date.issued1985en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/2913
dc.description"December 1985."en_US
dc.descriptionBibliography: p. 56-57.en_US
dc.description.sponsorshipNational Science Foundation Grant NSF-ECS-8217668en_US
dc.description.statementofresponsibilityby Dimitri P. Bertsekas, Patrick A. Hossein, Paul Tseng.en_US
dc.format.extent57 p.en_US
dc.format.extent3152126 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 ; 1523en_US
dc.subject.lccTK7855.M41 E3845 no.1523en_US
dc.subject.lcshMathematical optimizationen_US
dc.subject.lcshConvex programmingen_US
dc.subject.lcshLinear programmingen_US
dc.titleRelaxation methods for network flow problems with convex arc costsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record