Effective lower bounding techniques for pseudo-Boolean optimization [EDA applications]
暂无分享,去创建一个
[1] S. Yang,et al. Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .
[2] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[3] Srinivas Devadas,et al. Solving Covering Problems Using LPR-based Lower Bounds , 1997, Proceedings of the 34th Design Automation Conference.
[4] Olivier Coudert,et al. On solving covering problems , 1996, DAC '96.
[5] John N. Hooker,et al. Logic-Based Methods for Optimization , 1994, PPCP.
[6] P. Barth. A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , 1995 .
[7] Andreas Kuehlmann,et al. A fast pseudo-Boolean constraint solver , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[8] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[9] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[10] Vasco M. Manquinho,et al. Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[11] Matthew L. Ginsberg,et al. Inference methods for a pseudo-boolean satisfiability solver , 2002, AAAI/IAAI.
[12] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[13] Igor L. Markov,et al. Generic ILP versus specialized 0-1 ILP: an update , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..
[14] Tiziano Villa,et al. Explicit and implicit algorithms for binate covering problems , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..