| Record ID | marc_loc_2016/BooksAll.2016.part16.utf8:212199472:850 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part16.utf8:212199472:850?format=raw |
LEADER: 00850nam a2200229 a 4500
001 85231542
003 DLC
005 19900301064538.2
008 900301s1985 onca b 00010 eng
010 $a 85231542
040 $aDLC$cDLC$dDLC
050 00 $aT57.76$b.C87 1985
082 00 $a519.7/2$220
100 10 $aCurrie, James D.
245 14 $aThe complexity of the simplex algorithm /$cby James D. Currie.
260 0 $a[Ottawa] :$bCarleton University, Mathematics and Statistics :$bUniversity of Ottawa, Mathematics,$c[1985]
300 $a64 p. :$bill. ;$c28 cm.
490 1 $aCarleton-Ottawa mathematical lecture note series,$x0827-3669 ;$vno. 4 (May 1985)
502 $aThesis (masters)--Carleton University, 1984.
504 $aBibliography: p. 64.
650 0 $aLinear programming.
830 0 $aCarleton-Ottawa mathematical lecture note series ;$vno. 4.