Chapters of A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

Book Informaton

Author

Tomoyasu Nakagawa

Series

Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 462

Year of Publication

1971

Publisher

Dept. of Computer Science, University of Illinois

City of Publication

Urbana

Language

ARI Id

1672665282294

Find on

This page has been accessed 6 times.

Access Options

Internet Archive

Citation Options

Download Citation

About

Table of Contents of this work does not exist. Please type the table of contents of the book for the greater good of community.

Table of Contents (one per line)*

Use " / " to enter authors of chapter. For example (Title of Chapter / Author) Use " | " to enter pages of chapter. For example (Title of Chapter / Author | 10)

Helping tools to edit table of contents and see preview

Search Replace Case Sensitive FIND | FIND/REPLACE | REPLACE ALL

Your Name

Email Address

Whatsapp No

Topics

Branch and bound algorithms Switching theory

A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)