Relaxation methods for network flow problems with convex arc costs

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2913

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Hossein, Patrick A	-
dc.contributor	Tseng, Paul.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:26:26Z	-
dc.date	2003-04-29T15:26:26Z	-
dc.date	1985	-
dc.date.accessioned	2013-06-04T16:15:42Z	-
dc.date.available	2013-06-04T16:15:42Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/2913	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Dimitri P. Bertsekas, Patrick A. Hossein, Paul Tseng.	-
dc.description	"December 1985."	-
dc.description	Bibliography: p. 56-57.	-
dc.description	National Science Foundation Grant NSF-ECS-8217668	-
dc.format	57 p.	-
dc.format	3152126 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 1523	-
dc.subject	TK7855.M41 E3845 no.1523	-
dc.subject	Mathematical optimization	-
dc.subject	Convex programming	-
dc.subject	Linear programming	-
dc.title	Relaxation methods for network flow problems with convex arc costs	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI