Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3438| Title: | E-relaxation and auction method for separable convex cost network flow problems |
| Authors: | Bertsekas, Dimitri P. Polymenakos, Lazaros. Tseng, Paul. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Keywords: | TK7855.M41 E3845 no.2367 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| Description: | by Dimitri P. Bertsekas, Lazaros C. Polymenakos and Paul Tseng. Caption title. Includes bibliographical references (p. 19-21). Supported by the NSF. CCR-9103804 9300494-DMI |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/3438 |
| 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.