| Record ID | ia:grouptheoreticbr00shap |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/grouptheoreticbr00shap/grouptheoreticbr00shap_marc.xml |
| Download MARC binary | https://www.archive.org/download/grouptheoreticbr00shap/grouptheoreticbr00shap_meta.mrc |
LEADER: 01212nam 2200325I 45q0
001 000258944
003 MCM
004 000258944
005 20010608114430.0
008 861015s1967 mau rtb 000 0 eng d
035 $aMITb10258944
035 $a(OCoLC)14398834
035 $aGLIS00258944
040 $aRQB$cRQB
090 $aHD28$b.M414 no.302-, 67
099 $aHD28.M414 no.302- 67
100 1 $aShapiro, Jeremy F.,$d1939-
245 12 $aA group theoretic branch and bound algorithm for the zero-one integer programming problem,$cby Jeremy F. Shapiro.
260 $a[Cambridge, Mass.,$bM.I.T.]$c1967.
300 $a53 leaves.
490 1 $aM.I.T. Alfred P. Sloan School of Management. Working papers$v302-67
504 $aBibliography: leaves 40-42
650 00 $aBranch and bound algorithms.
650 00 $aInteger programming.
830 0 $aWorking paper (Sloan School of Management) ;$v302-67.
852 0 $aMCM$bARC$cNOLN2$hHD28.M414 no.302- 67$z$4Institute Archives$5Noncirculating Collection 2
852 0 $aMCM$bDEW$cBASMT$hHD28.M414 no.302- 67$z$4Dewey Library$5Basement
049 $aRQBG [Dewey] [Archives]
910 $aRECONjc861015
949 $aMYGV$b39080003702005$aMYGD$lD*BAS$b39080003702039