| dc.contributor | Bertsekas, Dimitri P. | en_US |
| dc.date.accessioned | 2003-04-29T15:43:45Z | |
| dc.date.available | 2003-04-29T15:43:45Z | |
| dc.date.issued | 1979 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3476 | |
| dc.description | Includes bibliographies. | en_US |
| dc.description.sponsorship | Research supported by National Science Foundation Grant ENG-79-06332 (87649) | en_US |
| dc.description.statementofresponsibility | by Dimitri P. Bertsekas. | en_US |
| dc.format.extent | 34, [7] leaves | en_US |
| dc.format.extent | 2581845 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 | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. LIDS-R ; 945. | en_US |
| dc.subject.lcc | TK7855.M41 E386 no.945 | en_US |
| dc.subject.lcsh | Algorithms | en_US |
| dc.subject.lcsh | Computational complexity | en_US |
| dc.subject.lcsh | Network analysis (Planning) | en_US |
| dc.title | New algorithms for assignment and transportation problems | en_US |
