An auction algorithm for shortest paths
Caption title.
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Massachusetts Institute of Technology, Laboratory for Information and Decision Systems
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/3222 |
| _version_ | 1811071402830200832 |
|---|---|
| author2 | Bertsekas, Dimitri P. |
| author_facet | Bertsekas, Dimitri P. |
| collection | MIT |
| description | Caption title. |
| first_indexed | 2024-09-23T08:50:28Z |
| id | mit-1721.1/3222 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:50:28Z |
| publishDate | 2003 |
| publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| record_format | dspace |
| spelling | mit-1721.1/32222019-04-10T19:20:56Z An auction algorithm for shortest paths Bertsekas, Dimitri P. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.2000 Caption title. Includes bibliographical references (p. 27-29). Research supported by the ARO. DAAL03-86-K-0171 Research supported by the NSF. DDM-8903385 by Dimitri P. Bertsekas. 2003-04-29T15:35:43Z 2003-04-29T15:35:43Z 1990 http://hdl.handle.net/1721.1/3222 eng LIDS-P ; 2000 29 p. 2216928 bytes application/pdf application/pdf Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| spellingShingle | TK7855.M41 E3845 no.2000 An auction algorithm for shortest paths |
| title | An auction algorithm for shortest paths |
| title_full | An auction algorithm for shortest paths |
| title_fullStr | An auction algorithm for shortest paths |
| title_full_unstemmed | An auction algorithm for shortest paths |
| title_short | An auction algorithm for shortest paths |
| title_sort | auction algorithm for shortest paths |
| topic | TK7855.M41 E3845 no.2000 |
| url | http://hdl.handle.net/1721.1/3222 |