Comparison of the implicit enumeration method and the branch-and-bound method for logical design
| Data(s) |
31/12/1969
|
|---|---|
| Resumo |
Bibliography: p. 91-94. Mode of access: Internet. |
| Formato |
con |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Urbana, Dept. of Computer Science, University of Illinois |
| Direitos |
Items in this record are available as Creative Commons Attribution-NonCommercial-ShareAlike. View access and use profile at http://www.hathitrust.org/access_use#cc-by-nc-sa-3.0. Please see individual items for rights and use statements. |
| Palavras-Chave | #Logic design #Branch and bound algorithms #Integer programming |
| Tipo |
text |
