✦ LIBER ✦

Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem

✍ Scribed by Manquinho, V.M.; Marques-Silva, J.P.

Book ID: 119778891
Publisher: IEEE
Year: 2002
Tongue: English
Weight: 393 KB
Volume: 21
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.998623

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implementation of a Variance Reduction-B

Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem

✍ Pardalos, P. M.; Ramakrishnan, K. G.; Resende, M. G. C.; Li, Y. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB