Effective lower bounding techniques for Pseudo-Boolean Optimization

Proceedings -Design, Automation and Test in Europe, DATE '05

Volumn II, Issue , 2005, Pages 660-665

  Manquinho, Vasco M ^a   Marques Silva, João ^a  

^a INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SIMULATION; CONSTRAINT THEORY; ESTIMATION; PROBLEM SOLVING; SYSTEMS ANALYSIS;

COST FUNCTION; ELECTRONIC DESIGN AUTOMATION (EDA); PSEUDO-BOOLEAN OPTIMIZATION (PBO); SAT-RELATED TECHNIQUES;

OPTIMIZATION;

EID: 33646924005     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2005.126     Document Type: Conference Paper

References (18)

1. CPLEX MILP solver, http://www.ilog.com/products/cplex/.
2. F. Aloul, A. Ramani, I. Markov, and K. Sakallah. Generic ILP versus specialized 0-1 ILP: An update. In ACM/IEEE International Conference on Computer Aided Design, pages 450-457, November 2002.
3. P. Barth, A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2-003. Max Plank Institute for Computer Science, 1995.
4. D. Chai and A. Kuehlmann. A Fast Pseudo-Boolean Constraint Solver. In Proc. ACM/IEEE Design Automation Conference, pages 830-835, 2003.
5. O. Coudert. On Solving Covering Problems. In Proc. ACM/IEEE Design Automation Conference, pages 197-202, June 1996.
6. H. Dixon and M. Ginsberg. Inference Methods for a PseudoBoolean Satisfiability Solver. In National Conference on Artificial Intelligence, pages 635-640, 2002.
7. J. Hooker. Logic-Based Methods for Optimization. In Jon Wiley & Sons, 1996.
8. S. Liao and S. Devadas. Solving Covering Problems Using LPR-Based Lower Bounds. In Proc. ACM/IEEE Design Automation Conference, pages 117-120, 1997.
9. V. Manquinho and J. Marques-Silva. Search pruning techniques in sat-based branch-and-bound algorithms for the binate covering problem. IEEE Transactions on Computer-Aided Design, 21(5):505-516, May 2002.
10. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. ACM/IEEE Design Automation Conference, pages 530-535, June 2001.
11. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
12. T. M. R. Ahuja and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Pearson Education, 1993.
13. A. S. S. Nash. Linear and Nonlinear Programming. In McGraw-Hill, 1996.
14. M. Savelsbergh. Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing, 6:445-454, 1994.
15. T. Villa, T. Kam, R. K. Brayton. and A. L. SangiovanniVincentelli. Explicit and Implicit Algorithms for Binate Covering Problems. IEEE Transactions on Computer Aided Design, vol. 16(7):677-691, July 1997.
16. J. Walser. 0-1 integer programming benchmarks. http://www.ps.uni-sb.de/ ~walser/benchmarks/benchmarks.html.
17. S. Yang. Logic Synthesis and Optimization Benchmarks User Guide. Microelectronics Center of North Carolina, January 1991.
18. Z. Zhu. Synthesis for mixed ptl/cmos circuit. http://www-unix.ecs.umass. edu/~zzhu/.