| dc.contributor |
Bertsekas, Dimitri P. |
|
| dc.contributor |
Polymenakos, Lazaros. |
|
| dc.contributor |
Tseng, Paul. |
|
| dc.contributor |
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
|
| dc.date |
2003-04-29T15:42:30Z |
|
| dc.date |
2003-04-29T15:42:30Z |
|
| dc.date |
1996 |
|
| dc.date.accessioned |
2013-06-04T16:17:27Z |
|
| dc.date.available |
2013-06-04T16:17:27Z |
|
| dc.date.issued |
2013-06-05 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/3438 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
by Dimitri P. Bertsekas, Lazaros C. Polymenakos and Paul Tseng. |
|
| dc.description |
Caption title. |
|
| dc.description |
Includes bibliographical references (p. 19-21). |
|
| dc.description |
Supported by the NSF. CCR-9103804 9300494-DMI |
|
| dc.format |
21, iii p. |
|
| dc.format |
1985457 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
|
| dc.relation |
LIDS-P ; 2367 |
|
| dc.subject |
TK7855.M41 E3845 no.2367 |
|
| dc.title |
E-relaxation and auction method for separable convex cost network flow problems |
|