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

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



Download Options

Buy this book

Last edited by ImportBot
July 24, 2014 | History

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

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

Publish Date
Language
English
Pages
39

Buy this book

Previews available in: English

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

Add another edition?

Book Details


Edition Notes

Bibliography: p. 39.

Published in
Urbana
Series
Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. 462, Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- 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
OL25464113M
Internet Archive
branchandboundal462naka
OCLC/WorldCat
281837

Source records

Internet Archive item 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
July 24, 2014 Created by ImportBot import new book