| Record ID | ia:branchandboundal462naka |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/branchandboundal462naka/branchandboundal462naka_marc.xml |
| Download MARC binary | https://www.archive.org/download/branchandboundal462naka/branchandboundal462naka_meta.mrc |
LEADER: 00880nam 2200229 4500
001 826761
005 20020415161746.0
008 720321s1971 ilua b 00000 engm
035 $a(OCoLC)ocm00281837
035 $9ADJ-9748
040 $aDLC$cDLC$dm.c.$dUIU
050 0 $aQA76$b.I4 no. 462$aQA401
082 $a001.6/4/08 s$a519.7
100 10 $aNakagawa, Tomoyasu.
245 12 $aA branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
260 0 $aUrbana,$bDept. of Computer Science, University of Illinois$c[1971]
300 $a39 p.$billus.$c28 cm.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 462
504 $aBibliography: p. 39.
650 0 $aSwitching theory
650 0 $aBranch and bound algorithms
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 462