Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2913| Title: | Relaxation methods for network flow problems with convex arc costs |
| Authors: | Bertsekas, Dimitri P. Hossein, Patrick A Tseng, Paul. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Keywords: | TK7855.M41 E3845 no.1523 Mathematical optimization Convex programming Linear programming |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| Description: | by Dimitri P. Bertsekas, Patrick A. Hossein, Paul Tseng. "December 1985." Bibliography: p. 56-57. National Science Foundation Grant NSF-ECS-8217668 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/2913 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.