{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:25:01Z","timestamp":1725513901154},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727873"},{"type":"electronic","value":"9783540727880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72788-0_9","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T12:25:22Z","timestamp":1183033522000},"page":"56-69","source":"Crossref","is-referenced-by-count":4,"title":["Solving Multi-objective Pseudo-Boolean Problems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lukasiewycz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gla\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Haubelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Teich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Barth, P.: A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization. Research Report MPI-I-95-2-003, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1995)","key":"9_CR1"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"STOC \u201971: Proceedings of the third annual ACM symposium on Theory of computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC \u201971: Proceedings of the third annual ACM symposium on Theory of computing, Shaker Heights, Ohio, United States, pp. 151\u2013158. ACM Press, New York (1971), doi:10.1145\/800157.805047"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/337292.337611","volume-title":"DAC \u201900: Proceedings of the 37th conference on Design automation","author":"J.P. Marques-Silva","year":"2000","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Boolean satisfiability in electronic design automation. In: DAC \u201900: Proceedings of the 37th conference on Design automation, Los Angeles, California, United States, pp. 675\u2013680. ACM Press, New York (2000), doi:10.1145\/337292.337611"},{"issue":"7","key":"9_CR5","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM\u00a05(7), 394\u2013397 (1962), doi:10.1145\/368273.368557","journal-title":"Commun. ACM"},{"key":"9_CR6","first-page":"220","volume-title":"ICCAD \u201996: Proceedings of the 1996 IEEE\/ACM international conference on Computer-aided design","author":"J.P. Marques-Silva","year":"1996","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Grasp - a new search algorithm for satisfiability. In: ICCAD \u201996: Proceedings of the 1996 IEEE\/ACM international conference on Computer-aided design, San Jose, California, United States, pp. 220\u2013227. IEEE Computer Society, Washington (1996)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/378239.379017","volume-title":"DAC \u201901: Proceedings of the 38th conference on Design automation","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., et al.: Chaff: engineering an efficient sat solver. In: DAC \u201901: Proceedings of the 38th conference on Design automation, Las Vegas, Nevada, United States, pp. 530\u2013535. ACM Press, New York (2001), doi:10.1145\/378239.379017"},{"key":"9_CR8","first-page":"279","volume-title":"ICCAD \u201901: Proc. of the 2001 IEEE\/ACM international conference on Computer-aided design","author":"L. Zhang","year":"2001","unstructured":"Zhang, L., et al.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD \u201901: Proc. of the 2001 IEEE\/ACM international conference on Computer-aided design, San Jose, California, pp. 279\u2013285. IEEE Press, Piscataway (2001)"},{"key":"9_CR9","first-page":"450","volume-title":"ICCAD \u201902: Proceedings of the 2002 IEEE\/ACM international conference on Computer-aided design","author":"F.A. Aloul","year":"2002","unstructured":"Aloul, F.A., et al.: Generic ilp versus specialized 0-1 ilp: an update. In: ICCAD \u201902: Proceedings of the 2002 IEEE\/ACM international conference on Computer-aided design, San Jose, California, pp. 450\u2013457. ACM Press, New York (2002), doi:10.1145\/774572.774638"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/HSC.1997.584597","volume-title":"CODES \u201997: Proceedings of the 5th International Workshop on Hardware\/Software Co-Design","author":"J. Teich","year":"1997","unstructured":"Teich, J., Blickle, T., Thiele, L.: An evolutionary approach to system-level synthesis. In: CODES \u201997: Proceedings of the 5th International Workshop on Hardware\/Software Co-Design, Washington, DC, USA, p. 167. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/DATE.2005.246","volume-title":"DATE \u201905: Proc. of the conf. on Design, Automation and Test in Europe","author":"H.M. Sheini","year":"2005","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: A modern pseudo-boolean sat solver. In: DATE \u201905: Proc. of the conf. on Design, Automation and Test in Europe, Washington, DC, USA, pp. 684\u2013685. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1145\/775832.776041","volume-title":"DAC \u201903: Proc. of the 40th conference on Design automation","author":"D. Chai","year":"2003","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-boolean constraint solver. In: DAC \u201903: Proc. of the 40th conference on Design automation, Anaheim, CA, USA, pp. 830\u2013835. ACM Press, New York (2003), doi:10.1145\/775832.776041"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Moelding and Computation\u00a02, 1\u201325 (2006)","journal-title":"Journal on Satisfiability, Boolean Moelding and Computation"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"unstructured":"Tseitin, G.S.: On the Complexity of Derivations in Propositional Calculus. Studies in Contr. Math. and Math. Logic (1968)","key":"9_CR15"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E. Zitzler","year":"2003","unstructured":"Zitzler, E., et al.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evolutionary Computation\u00a07(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/DATE.2005.126","volume-title":"DATE \u201905: Proceedings of the conference on Design, Automation and Test in Europe","author":"V.M. Manquinho","year":"2005","unstructured":"Manquinho, V.M., Marques-Silva, J.: Effective lower bounding techniques for pseudo-boolean optimization. In: DATE \u201905: Proceedings of the conference on Design, Automation and Test in Europe, Washington, DC, USA, pp. 660\u2013665. IEEE Computer Society Press, Los Alamitos (2005)"},{"unstructured":"Berre, D.L., Simon, L.: Sat competition 2005. Website (2005), Available online at http:\/\/www.satcompetition.org\/2005\/","key":"9_CR18"},{"unstructured":"Manquinho, V., Roussel, O.: Pseudo boolean evaluation 2006. Website (2006), Available online at http:\/\/www.cril.univ-artois.fr\/PB06\/","key":"9_CR19"},{"key":"9_CR20","first-page":"1168","volume-title":"Proceedings of Design, Automation and Test in Europe","author":"C. Haubelt","year":"2003","unstructured":"Haubelt, C., et al.: SAT-Based Techniques in System Design. In: Wehn, N., Verkest, D. (eds.) Proceedings of Design, Automation and Test in Europe, Munich, Germany, March 2003, pp. 1168\u20131169. IEEE Computer Society Press, Los Alamitos (2003)"},{"volume-title":"Optimization for Engineering Design","year":"1995","unstructured":"Deb, K. (ed.): Optimization for Engineering Design. Prentice-Hall of India Pvt.Ltd., New Delhi (1995)","key":"9_CR21"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72788-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T05:42:27Z","timestamp":1629092547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72788-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727873","9783540727880"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72788-0_9","relation":{},"subject":[]}}