Effective Lower Bounding Techniques for Pseudo-Boolean Optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Effective Lower Bounding Techniques for Pseudo-Boolean Optimization

Résumé

Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), new algorithms for PBO have emerged, which are effective on highly constrained instances. However, these algorithms fail to handle effectively the information provided by the cost function of PBO. This paper addresses the integration of lower bound estimation methods with SAT-related techniques in PBO solvers. Moreover, the paper shows that the utilization of lower bound estimates can dramatically improve the overall performance of PBO solvers for most existing benchmarks from EDA.
Fichier principal
Vignette du fichier
228820660.pdf (138.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00181183 , version 1 (23-10-2007)

Identifiants

  • HAL Id : hal-00181183 , version 1

Citer

Vasco M. Manquinho, Joao Marques-Silva. Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. DATE'05, Mar 2005, Munich, Germany. pp.660-665. ⟨hal-00181183⟩

Collections

DATE
20 Consultations
256 Téléchargements

Partager

Gmail Facebook X LinkedIn More