Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
Includes bibliographical references (p. 16-17).
| 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/3292 |
| _version_ | 1826198408115781632 |
|---|---|
| author2 | Bertsekas, Dimitri P. |
| author_facet | Bertsekas, Dimitri P. |
| collection | MIT |
| description | Includes bibliographical references (p. 16-17). |
| first_indexed | 2024-09-23T11:04:24Z |
| id | mit-1721.1/3292 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:04:24Z |
| publishDate | 2003 |
| publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| record_format | dspace |
| spelling | mit-1721.1/32922019-04-12T08:16:45Z Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow Bertsekas, Dimitri P. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.2147 Includes bibliographical references (p. 16-17). Supported by the NSF. CCR-9103804 Supported by the ARO. DAAL03-92-G-0115 by Dimitri P. Bertsekas. 2003-04-29T15:38:01Z 2003-04-29T15:38:01Z 1992 http://hdl.handle.net/1721.1/3292 eng LIDS-P ; 2147 17 p. 1078831 bytes application/pdf application/pdf Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| spellingShingle | TK7855.M41 E3845 no.2147 Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow |
| title | Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow |
| title_full | Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow |
| title_fullStr | Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow |
| title_full_unstemmed | Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow |
| title_short | Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow |
| title_sort | mathematical equivalence of the auction algorithm for assignment and the e relaxation preflow push method for min cost flow |
| topic | TK7855.M41 E3845 no.2147 |
| url | http://hdl.handle.net/1721.1/3292 |