An e-relaxation method for separable convex cost network flow problems
Includes bibliographical references (p. 16-18).
| 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/3409 |
| _version_ | 1811092907417927680 |
|---|---|
| author2 | Bertsekas, Dimitri P. |
| author_facet | Bertsekas, Dimitri P. |
| collection | MIT |
| description | Includes bibliographical references (p. 16-18). |
| first_indexed | 2024-09-23T15:34:13Z |
| id | mit-1721.1/3409 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T15:34:13Z |
| publishDate | 2003 |
| publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| record_format | dspace |
| spelling | mit-1721.1/34092019-04-10T09:30:54Z An e-relaxation method for separable convex cost network flow problems Bertsekas, Dimitri P. Polymenakos, Lazaros. Tseng, Paul. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.2299 Includes bibliographical references (p. 16-18). Supported by the NSF. CCR-9103804 9300494-DMI by Dimitri P. Bertsekas, Lazaros C. Polymenakos and Paul Tseng. 2003-04-29T15:41:38Z 2003-04-29T15:41:38Z 1995 http://hdl.handle.net/1721.1/3409 eng LIDS-P ; 2299 18, iii p. 2496204 bytes application/pdf application/pdf Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| spellingShingle | TK7855.M41 E3845 no.2299 An e-relaxation method for separable convex cost network flow problems |
| title | An e-relaxation method for separable convex cost network flow problems |
| title_full | An e-relaxation method for separable convex cost network flow problems |
| title_fullStr | An e-relaxation method for separable convex cost network flow problems |
| title_full_unstemmed | An e-relaxation method for separable convex cost network flow problems |
| title_short | An e-relaxation method for separable convex cost network flow problems |
| title_sort | e relaxation method for separable convex cost network flow problems |
| topic | TK7855.M41 E3845 no.2299 |
| url | http://hdl.handle.net/1721.1/3409 |