Parallel shortest path auction algorithms

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

Full metadata record

DC Field	Value	Language
dc.contributor	Polymenakos, Lazaros.	-
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:38:07Z	-
dc.date	2003-04-29T15:38:07Z	-
dc.date	1992	-
dc.date.accessioned	2013-06-04T16:16:35Z	-
dc.date.available	2013-06-04T16:16:35Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3296	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	L.C. Polymenakos, D.P. Bertsekas.	-
dc.description	Caption title.	-
dc.description	Includes bibliographical references (p. 31-32).	-
dc.description	Supported by the NSF. DDM-8903385 CCR-9108058	-
dc.format	32 p.	-
dc.format	1966273 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]	-
dc.relation	LIDS-P ; 2151	-
dc.subject	TK7855.M41 E3845 no.2151	-
dc.title	Parallel shortest path auction algorithms	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI