Show simple item record

The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

dc.contributor.authorBertsimas, Dimitrisen_US
dc.contributor.otherSloan School of Management.en_US
dc.date.accessioned2009-10-04T03:57:12Z
dc.date.available2009-10-04T03:57:12Z
dc.date.issued1988en_US
dc.identifierprobabilisticmin00berten_US
dc.identifier.urihttp://hdl.handle.net/1721.1/48847
dc.publisherCambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technologyen_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 2057-88.en_US
dc.titleThe probabilistic minimum spanning tree problem : Part I--complexity and combinatorial propertiesen_US
dc.typeWorking Paperen_US
dc.identifier.oclc20061239en_US
dc.identifier.aleph000389827en_US


Files in this item

Thumbnail
Name:
probabilisticmin00bert.pdf
Size:
1.604Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record