Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

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

Download
Author: Bertsimas, Dimitris J.
Publisher: Massachusetts Institute of Technology, Operations Research Center
Date Issued: 1988
Description:
Includes bibliographical references.
URI: http://hdl.handle.net/1721.1/5077
Series/Report no.: Operations Research Center Working Paper;OR 183-88

Show full item metadata

Files in this item

Name Size Format Description
OR-183-88-20061239.pdf 1.672Mb PDF

This item appears in the following Collection(s)

MIT-Mirage