| dc.contributor | Bertsekas, Dimitri P. | en_US |
| dc.contributor | Pallottino, Stefano. | en_US |
| dc.contributor | Scutellà, Maria Grazia. | en_US |
| dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
| dc.date.accessioned | 2003-04-29T15:37:01Z | |
| dc.date.available | 2003-04-29T15:37:01Z | |
| dc.date.issued | 1992 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3264 | |
| dc.description | Includes bibliographical references (p. 24-25). | en_US |
| dc.description.sponsorship | 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. | en_US |
| dc.description.statementofresponsibility | by Dimitri P. Bertsekas, Stefano Pallottino, and Maria Grazia Scutella. | en_US |
| dc.format.extent | 29 p. | en_US |
| dc.format.extent | 2207559 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] | en_US |
| dc.relation.ispartofseries | LIDS-P ; 2107 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.2107 | en_US |
| dc.title | Polynomial auction algorithms for shortest paths | en_US |
