| dc.contributor | Bertsekas, Dimitri P. | en_US |
| dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
| dc.date.accessioned | 2003-04-29T15:38:00Z | |
| dc.date.available | 2003-04-29T15:38:00Z | |
| dc.date.issued | 1992 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3291 | |
| dc.description | Caption title. | en_US |
| dc.description | Includes bibliographical references (p. 9-10). | en_US |
| dc.description.sponsorship | Supported by the NSF. CCR-9103804 | en_US |
| dc.description.statementofresponsibility | by Dimitri P. Bertsekas. | en_US |
| dc.format.extent | 10 p. | en_US |
| dc.format.extent | 1370611 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 ; 2146 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.2146 | en_US |
| dc.title | An auction/sequential shortest path algorithm for the minimum cost network flow problem | en_US |
