A generic auction algorithm for the minimum cost network flow problem
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/3247 |
| _version_ | 1811087526210830336 |
|---|---|
| author2 | Bertsekas, Dimitri P. |
| author_facet | Bertsekas, Dimitri P. |
| collection | MIT |
| description | Caption title. |
| first_indexed | 2024-09-23T13:47:30Z |
| id | mit-1721.1/3247 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:47:30Z |
| publishDate | 2003 |
| publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| record_format | dspace |
| spelling | mit-1721.1/32472019-04-11T09:43:51Z A generic auction algorithm for the minimum cost network flow problem Bertsekas, Dimitri P. Castañon, David A. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.2084 Caption title. Includes bibliographical references (p. 40-43). by Dimitri P. Bertsekas and David A. Castanon. 2003-04-29T15:36:25Z 2003-04-29T15:36:25Z 1991 http://hdl.handle.net/1721.1/3247 eng LIDS-P ; 2084 43 p. 3106877 bytes application/pdf application/pdf Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| spellingShingle | TK7855.M41 E3845 no.2084 A generic auction algorithm for the minimum cost network flow problem |
| title | A generic auction algorithm for the minimum cost network flow problem |
| title_full | A generic auction algorithm for the minimum cost network flow problem |
| title_fullStr | A generic auction algorithm for the minimum cost network flow problem |
| title_full_unstemmed | A generic auction algorithm for the minimum cost network flow problem |
| title_short | A generic auction algorithm for the minimum cost network flow problem |
| title_sort | generic auction algorithm for the minimum cost network flow problem |
| topic | TK7855.M41 E3845 no.2084 |
| url | http://hdl.handle.net/1721.1/3247 |