We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

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

Thumbnail Image
Download
Name

OR-183-88-20061239.pdf

Size

1.67 MB

Format

Adobe PDF

Checksum (MD5)

1725c1a8863e44bdeeac443548a8dbe3

Date Issued
1988
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 183-88
Description
Includes bibliographical references.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.