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.
Record type:
Article
More information
Published date: May 2002
Related URLs:
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 262211
URI: http://eprints.soton.ac.uk/id/eprint/262211
PURE UUID: b8e86a21-5278-4ae6-becf-81a695970d72
Catalogue record
Date deposited: 29 Mar 2006
Last modified: 14 Mar 2024 07:07
Export record
Contributors
Author:
V. M. Manquinho
Author:
J. P. Marques-Silva
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.