| Record ID | ia:probabilisticmin00bert |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/probabilisticmin00bert/probabilisticmin00bert_marc.xml |
| Download MARC binary | https://www.archive.org/download/probabilisticmin00bert/probabilisticmin00bert_meta.mrc |
LEADER: 01276nam 2200325K 45q0
001 000389827
003 MCM
004 000389827
005 20010608150832.0
008 890724s1988 maua rtb 000 0 eng d
035 $aMITb10389827
035 $a(OCoLC)20061239
035 $aGLIS00389827
040 $aMYG$cMYG
090 $aHD28$b.M414 no.2057-, 88
099 $aHD28.M414 no.2057- 88
100 1 $aBertsimas, Dimitris
245 14 $aThe probabilistic minimum spanning tree problem :$bPart I--complexity and combinatorial properties /$cDimitris Bertsimas.
260 $aCambridge, Mass. :$bSloan School of Management, Massachusetts Institute of Technology,$c1988.
300 $a41 p. :$bill. ;$c28 cm.
490 1 $aSloan W.P. ;$vno. 2057-88
504 $aIncludes bibliographical references.
710 2 $aSloan School of Management.
740 0 $aSpanning tree problem, the probabilistic minimum.
830 0 $aWorking paper (Sloan School of Management) ;$v2057-88.
852 0 $aMCM$bARC$cNOLN2$hHD28.M414 no.2057- 88$z$4Institute Archives$5Noncirculating Collection 2
852 0 $aMCM$bDEW$cBASMT$hHD28.M414 no.2057- 88$4Dewey Library$5Basement
049 $aMYGV$aMYGD
910 $aeas890724
949 $aMYGV$b39080005671653$aMYGD$b39080005671661$b39080005671679