An E-relaxation method for separable convex cost generalized network flow problems

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

Full metadata record

DC Field	Value	Language
dc.contributor	Tseng, Paul.	-
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:42:44Z	-
dc.date	2003-04-29T15:42:44Z	-
dc.date	1996	-
dc.date.accessioned	2013-06-04T16:17:33Z	-
dc.date.available	2013-06-04T16:17:33Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3445	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Paul Tseng, Dimitri P. Bertsekas.	-
dc.description	Cover title. "The extended abstract of this article appeared in the proceedings of the 5th International IPCO Conference, Vancouver, June 1996."--P. 1.	-
dc.description	Includes bibliographical references (p. 18-21).	-
dc.description	Supported by the National Science Foundation. CCR-9311621, DMI-9300494	-
dc.format	21 p.	-
dc.format	1513806 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 2374	-
dc.subject	TK7855.M41 E3845 no.2374	-
dc.title	An E-relaxation method for separable convex cost generalized network flow problems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI