dc.contributor | Bertsekas, Dimitri P. | en_US |
dc.contributor | Hossein, Patrick A | en_US |
dc.contributor | Tseng, Paul. | en_US |
dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
dc.date.accessioned | 2003-04-29T15:26:26Z | |
dc.date.available | 2003-04-29T15:26:26Z | |
dc.date.issued | 1985 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/2913 | |
dc.description | "December 1985." | en_US |
dc.description | Bibliography: p. 56-57. | en_US |
dc.description.sponsorship | National Science Foundation Grant NSF-ECS-8217668 | en_US |
dc.description.statementofresponsibility | by Dimitri P. Bertsekas, Patrick A. Hossein, Paul Tseng. | en_US |
dc.format.extent | 57 p. | en_US |
dc.format.extent | 3152126 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 ; 1523 | en_US |
dc.subject.lcc | TK7855.M41 E3845 no.1523 | en_US |
dc.subject.lcsh | Mathematical optimization | en_US |
dc.subject.lcsh | Convex programming | en_US |
dc.subject.lcsh | Linear programming | en_US |
dc.title | Relaxation methods for network flow problems with convex arc costs | en_US |