Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Sloan School of Management
  3. Sloan Working Papers
  4. The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

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

Thumbnail Image
Download
Name

probabilisticmin00bert.pdf

Size

1.6 MB

Format

Adobe PDF

Checksum (MD5)

df9e6b4ec5a774b9ed6f363698b9c0c9

Author(s)
Bertsimas, Dimitris
Date Issued
1988
Publisher
Cambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 2057-88.
Persistent DSpace Link
http://hdl.handle.net/1721.1/48847
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.