Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem
Manquinho, V. M. and Marques-Silva, J. P. (2002) Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem. IEEE Transactions on Computer-Aided Design, 21, (5), 505-516.
This is the latest version of this item.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Restricted to Registered users only Download (392Kb) |
| Item Type: | Article |
|---|---|
| Related URLs: | |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 262211 |
| Date Deposited: | 29 Mar 2006 |
| Last Modified: | 16 Aug 2012 03:46 |
| Contributors: | Manquinho, V. M. (Author) Marques-Silva, J. P. (Author) |
| Date: | May 2002 |
| Status: | Published |
| Further Information: | Google Scholar |
| ISI Citation Count: | 17 |
| URI: | http://eprints.soton.ac.uk/id/eprint/262211 |
Available Versions of this Item
- Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem. (deposited 29 Mar 2006) [Currently Displayed]
Actions (login required)
 |
View Item |
