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

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

by

A branch-and-bound algorithm for optimal AND- ...
Tomoyasu Nakagawa, Tomoyasu Na ...
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
Notes

Buy this book

Last edited by Open Library Bot
December 5, 2010 | History
Edit
An edition of A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description) (1971)

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

by

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Dept. of Computer Science, University of Illinois
Language
English
Pages
39

Buy this book

Subjects

Branch and bound algorithms, Switching theory
Edition Availability
Cover of: A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
1971, Dept. of Computer Science, University of Illinois
in English
  • Not in Library

Add another edition?

Book Details

Edition Notes

Bibliography: p. 39.

Published in
Urbana
Series
University of Illinois at Urbana-Champaign. Dept. of Computer Science. Report no. 462

Classifications

Dewey Decimal Class
001.6/4/08 s, 519.7
Library of Congress
QA76 .I4 no. 462, QA401 .I4 no. 462

The Physical Object

Pagination
39 p.
Number of pages
39

ID Numbers

Open Library
OL5172882M
LCCN
74637322

Source records

Library of Congress MARC record

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 5, 2010 Edited by Open Library Bot Added subjects from MARC records.
December 10, 2009 Created by WorkBot add works page