| dc.contributor |
Bertsimas, Dimitris J. |
|
| dc.date |
2004-05-28T19:22:18Z |
|
| dc.date |
2004-05-28T19:22:18Z |
|
| dc.date |
1988 |
|
| dc.date.accessioned |
2013-10-09T02:37:31Z |
|
| dc.date.available |
2013-10-09T02:37:31Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5077 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
Dimitris Bertsimas. |
|
| dc.description |
Includes bibliographical references. |
|
| dc.format |
41 p. |
|
| dc.format |
1753937 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 183-88 |
|
| dc.title |
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties |
|