Parallel asynchronous primal-dual methods for the minimum cost flow problem

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

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Castañon, David A.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:35:42Z	-
dc.date	2003-04-29T15:35:42Z	-
dc.date	1990	-
dc.date.accessioned	2013-06-04T16:16:23Z	-
dc.date.available	2013-06-04T16:16:23Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3221	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Dimitri P. Bertsekas and David A. Castañon.	-
dc.description	Cover title. "September 1990."	-
dc.description	Includes bibliographical references (p. 18-19).	-
dc.description	Research supported by the BM/C3 Technology branch of the United States Army Strategic Defense Command.	-
dc.format	19 p.	-
dc.format	1223186 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 1998	-
dc.subject	TK7855.M41 E3845 no.1998	-
dc.title	Parallel asynchronous primal-dual methods for the minimum cost flow problem	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI