"Search pruning techniques in SAT-based branch-and-bound algorithmsfor the ..."

Vasco M. Manquinho, João P. Marques Silva (2002)

> Home

Details and statistics

DOI: 10.1109/43.998623

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcad/ManquinhoM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/ManquinhoM02
Vasco M. Manquinho, João P. Marques Silva:
Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(5): 505-516 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.