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...
Saved in:
| Published in: | Design, Automation and Test in Europe pp. 660 - 665 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
Washington, DC, USA
IEEE Computer Society
07.03.2005
IEEE |
| Series: | ACM Conferences |
| Subjects: |
Mathematics of computing
> Mathematical analysis
> Mathematical optimization
> Continuous optimization
> Linear programming
Theory of computation
> Design and analysis of algorithms
> Algorithm design techniques
> Backtracking
|
| ISBN: | 9780769522883, 0769522882 |
| ISSN: | 1530-1591 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

