Polynomial auction algorithms for shortest paths

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

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Pallottino, Stefano.	-
dc.contributor	Scutellà, Maria Grazia.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:37:01Z	-
dc.date	2003-04-29T15:37:01Z	-
dc.date	1992	-
dc.date.accessioned	2013-06-04T16:16:27Z	-
dc.date.available	2013-06-04T16:16:27Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3264	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Dimitri P. Bertsekas, Stefano Pallottino, and Maria Grazia Scutella.	-
dc.description	Includes bibliographical references (p. 24-25).	-
dc.description	Supported by NSF. DDM-8903385 Supported by the ARO. C DAAL03-86-K-0171 Supported by a CNR-GNIM grant, and by a Fullbright grant.	-
dc.format	29 p.	-
dc.format	2207559 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]	-
dc.relation	LIDS-P ; 2107	-
dc.subject	TK7855.M41 E3845 no.2107	-
dc.title	Polynomial auction algorithms for shortest paths	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI