DSpace Repository

An e-relaxation method for separable convex cost network flow problems

Show simple item record

dc.contributor Bertsekas, Dimitri P.
dc.contributor Polymenakos, Lazaros.
dc.contributor Tseng, Paul.
dc.contributor Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
dc.date 2003-04-29T15:41:38Z
dc.date 2003-04-29T15:41:38Z
dc.date 1995
dc.date.accessioned 2013-06-04T16:17:13Z
dc.date.available 2013-06-04T16:17:13Z
dc.date.issued 2013-06-05
dc.identifier http://hdl.handle.net/1721.1/3409
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description by Dimitri P. Bertsekas, Lazaros C. Polymenakos and Paul Tseng.
dc.description Includes bibliographical references (p. 16-18).
dc.description Supported by the NSF. CCR-9103804 9300494-DMI
dc.format 18, iii p.
dc.format 2496204 bytes
dc.format application/pdf
dc.language eng
dc.publisher Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]
dc.relation LIDS-P ; 2299
dc.subject TK7855.M41 E3845 no.2299
dc.title An e-relaxation method for separable convex cost network flow problems


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account