Item Details

Print View

A Branch-and-Bound Algorithm for Optimal and-or Networks (the Algorithm Description)

Nakagawa, Tomoyasu
Format
Book; Online; EBook
Published
Urbana, Dept. of Computer Science, University of Illinois [1971]
Language
English
Series
Report (University of Illinois at Urbana-Champaign. Dept. Of Computer Science)
Description
39 p. illus. 28 cm.
Mode of access: Internet.
Notes
Bibliography: p. 39.
Series Statement
Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 462
Copyright Not EvaluatedCopyright Not Evaluated
Technical Details
  • Staff View

    LEADER 01584nam a2200373 4500
    001 100697769
    003 MiAaHDL
    005 20150526000000.0
    006 m d
    007 cr bn ---auaua
    008 720321s1971 ilua b 00000 engm
    035
      
      
    a| sdr-uiuc826761
    035
      
      
    9| ADJ-9748
    035
      
      
    a| (OCoLC)281837
    040
      
      
    a| DLC c| DLC d| m.c. d| UIU
    050
    0
      
    a| QA76 b| .I4 no. 462 a| QA401
    082
      
      
    a| 001.6/4/08 s a| 519.7
    100
    1
    0
    a| Nakagawa, Tomoyasu.
    245
    1
    2
    a| A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
    260
    0
      
    a| Urbana, b| Dept. of Computer Science, University of Illinois c| [1971]
    300
      
      
    a| 39 p. b| illus. c| 28 cm.
    490
      
    0
    a| Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) v| no. 462
    504
      
      
    a| Bibliography: p. 39.
    538
      
      
    a| Mode of access: Internet.
    650
      
    0
    a| Branch and bound algorithms
    650
      
    0
    a| Switching theory
    974
      
      
    8| ia.branchandboundal462naka b| UIU c| IUIUC d| 20180315 s| ia u| uiuo.ark:/13960/t12n6gk3c z| Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 462 y| 1971 r| cc-by-nc-sa-3.0 q| con
▾See more
▴See less

Access online

Google Preview

Google Books Preview