Effective Lower Bounding Techniques for Pseudo-Boolean Optimization

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.

• Type: Conference
• Year: 2005
• Where: DATE
• Authors: Vasco M. Manquinho, João P. Marques Silva
• Keywords: DATE 2005, Hardware, Linear Pseudo-Boolean Optimization, Lower Bound, PBO Solvers