Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Integration of lower bound estimates in pseudo-Boolean optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Manquinho, V.M. ; IST, Tech. Univ. Lisbon, Portugal ; Marques-Silva, J.

Linear pseudoBoolean optimization (PBO) has found applications in several areas, ranging from artificial intelligence to electronic design automation. Due to important advances in Boolean satisfiability (SAT), new algorithms for PBO have emerged, which are effective on highly constrained instances. However, those algorithms fail in dealing properly with the objective function of PBO. We propose an algorithm that uses lower bound estimation methods for pruning the search tree in integration with techniques from SAT algorithms. Moreover, we show that the utilization of lower bound estimates can dramatically improve the overall performance of PBO solvers for specific classes of instances. In addition, we describe how to apply nonchronological backtracking in the presence of conflicts that result from the bounding process, using different lower bound estimation methods.

Published in:

Tools with Artificial Intelligence, 2004. ICTAI 2004. 16th IEEE International Conference on

Date of Conference:

15-17 Nov. 2004