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:41:38Z
dc.date.available2003-04-29T15:41:38Z
dc.date.issued1995en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/3409
dc.descriptionIncludes bibliographical references (p. 16-18).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.extent18, iii p.en_US
dc.format.extent2496204 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 ; 2299en_US
dc.subject.lccTK7855.M41 E3845 no.2299en_US
dc.titleAn e-relaxation 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