| Record ID | ia:pruningbranching471naka |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/pruningbranching471naka/pruningbranching471naka_marc.xml |
| Download MARC binary | https://www.archive.org/download/pruningbranching471naka/pruningbranching471naka_meta.mrc |
LEADER: 01025cam 2200253 4500
001 826765
005 20020415161746.0
008 720321s1971 ilua b 00010 engm
035 $a(OCoLC)ocm00287096
035 $9ADJ-9752
040 $aDLC$cDLC$dm.c.$dUIU
050 0 $aQA76$b.I4 no. 471$aQA401
082 $a001.6/4/08 s$a519.7
100 10 $aNakagawa, Tomoyasu.
245 10 $aPruning and branching methods for designing optimal networks by the branch-and-bound method$c[by] Tomoyasu Nakagawa, Hung Chi Lai [and] Saburo Muroga.
260 0 $aUrbana,$bDept. of Computer Science, University of Illinois$c[1971]
300 $a59 p.$billus.$c28 cm.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 471
504 $aIncludes bibliographical references.
650 0 $aBranch and bound algorithms
650 0 $aSwitching theory
700 10 $aLai, Hung-Chi.
700 10 $aMuroga, Saburo.
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 471