Relaxation methods for minimum cost ordinary and 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/2882

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Tseng, Paul.	-
dc.date	2003-04-29T15:25:35Z	-
dc.date	2003-04-29T15:25:35Z	-
dc.date	1985	-
dc.date.accessioned	2013-06-04T16:15:39Z	-
dc.date.available	2013-06-04T16:15:39Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/2882	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Dimitri P. Bertsekas and Paul Tseng.	-
dc.description	Title from cover.	-
dc.description	Bibliography: p. 55-57.	-
dc.description	National Science Foundation Grant NSF-ECS-8217668.	-
dc.format	57 p.	-
dc.format	3294601 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology	-
dc.relation	LIDS-P ; 1462	-
dc.subject	TK7855.M41 E3845 no.1462	-
dc.title	Relaxation methods for minimum cost ordinary and generalized network flow problems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI