Relaxation methods for minimum cost network flow problems

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

Full metadata record

DC Field	Value	Language
dc.contributor	Tseng, Paul.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.contributor	Bertsekas, Dimitri P.	-
dc.date	2002-06-21T03:39:25Z	-
dc.date	2002-06-21T03:39:25Z	-
dc.date	1983	-
dc.date.accessioned	2013-05-31T15:43:31Z	-
dc.date.available	2013-05-31T15:43:31Z	-
dc.date.issued	2013-05-31	-
dc.identifier	http://hdl.handle.net/1721.1/1063	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	by Dimitri P. Bertsekas and Paul Tseng.	-
dc.description	Bibliography: p. 58-60.	-
dc.description	"October, 1983."	-
dc.description	Supported by the National Science Foundation under Grant NSF-ECS-8217668	-
dc.format	62 p.	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology	-
dc.relation	LIDS-P ; 1339	-
dc.subject	TK7855.M41 E3845 no.1339	-
dc.subject	Mathematical optimization	-
dc.subject	System analysis	-
dc.title	Relaxation methods for minimum cost network flow problems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI