The University of Southampton
University of Southampton Institutional Repository

Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem

Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem
Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem
505-516
Manquinho, V. M.
45535c7d-37db-4631-b037-1f4d5e3bcbc7
Marques-Silva, J. P.
89a72f8f-541d-46fc-8bb7-c621f720c991
Manquinho, V. M.
45535c7d-37db-4631-b037-1f4d5e3bcbc7
Marques-Silva, J. P.
89a72f8f-541d-46fc-8bb7-c621f720c991

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
Text
jpms-tcad02.pdf - Other
Restricted to Registered users only
Download (402kB)

More information

Published date: May 2002
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.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×