{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:49Z","timestamp":1772893129340,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141850","type":"print"},{"value":"9783642141867","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14186-7_16","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T22:20:37Z","timestamp":1278627637000},"page":"181-193","source":"Crossref","is-referenced-by-count":12,"title":["Improving Unsatisfiability-Based Algorithms for Boolean Optimization"],"prefix":"10.1007","author":[{"given":"Vasco","family":"Manquinho","sequence":"first","affiliation":[]},{"given":"Ruben","family":"Martins","sequence":"additional","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aloul, F., Ramani, A., Markov, I., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: An update. In: International Conference on Computer-Aided Design, pp. 450\u2013457 (2002)","DOI":"10.1145\/774572.774638"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02777-2_39","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"C. Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M., Levy, J.: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 427\u2013440. Springer, Heidelberg (2009)"},{"key":"16_CR3","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F.: An improved exact solver for partial max-sat. In: Proceedings of the International Conference on Nonconvex Programming: Local and Global Approaches (NCP-2007), pp. 230\u2013231 (2007)"},{"key":"16_CR4","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: Fourth Max-SAT evaluation (2009), http:\/\/www.maxsat.udl.cat\/09\/"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-24605-3_26","volume-title":"Theory and Applications of Satisfiability Testing","author":"F. Bacchus","year":"2004","unstructured":"Bacchus, F., Winter, J.: Effective preprocessing with hyper-resolution and equality reduction. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 183\u2013192. Springer, Heidelberg (2004)"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., Vance, P.: Branch-and-price: Column generation for solving huge integer programs. Operations Research\u00a046(3), 316\u2013329 (1998)","journal-title":"Operations Research"},{"key":"16_CR7","unstructured":"Barth, P.: A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for Computer Science (1995)"},{"key":"16_CR8","unstructured":"Berre, D.L.: SAT4J library, http:\/\/www.sat4j.org"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"2","author":"A. Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: Design Automation Conference, pp. 830\u2013835 (2003)","DOI":"10.1145\/775832.776041"},{"key":"16_CR11","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Minisat 2.0 sat solver, http:\/\/minisat.se\/MiniSat.html"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02 (2006)","DOI":"10.3233\/SAT190014"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 252\u2013265. Springer, Heidelberg (2006)"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2347","volume":"31","author":"F. Heras","year":"2008","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSAT: An efficient weighted Max-SAT solver. Journal of Artificial Intelligence Research\u00a031, 1\u201332 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2-3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J. Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artificial Intelligence\u00a0172(2-3), 204\u2013233 (2008)","journal-title":"Artificial Intelligence"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"C.M. Li","year":"2007","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for Max-SAT. Journal of Artificial Intelligence Research\u00a030, 321\u2013359 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"16_CR17","unstructured":"Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for MAX-SAT solving. In: International Joint Conference on Artificial Intelligence, pp. 2334\u20132339 (2007)"},{"issue":"5","key":"16_CR18","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/43.998623","volume":"21","author":"V. Manquinho","year":"2002","unstructured":"Manquinho, V., Marques-Silva, J.: Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem. IEEE Transactions on Computer-Aided Design\u00a021(5), 505\u2013516 (2002)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-02777-2_45","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"V. Manquinho","year":"2009","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for weighted boolean optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 495\u2013508. Springer, Heidelberg (2009)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-79719-7_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"J. Marques-Silva","year":"2008","unstructured":"Marques-Silva, J., Manquinho, V.: Towards more effective unsatisfiability-based maximum satisfiability algorithms. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 225\u2013230. Springer, Heidelberg (2008)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Design, Automation and Testing in Europe Conference, March 2008, pp. 408\u2013413 (2008)","DOI":"10.1109\/DATE.2008.4484715"},{"key":"16_CR22","unstructured":"Martins, R., Lynce, I., Manquinho, V.: Preprocessing in pseudo-boolean optimization: An experimental evaluation. In: Eighth International Workshop on Constraint Modelling and Reformulation (2009)"},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/SAT190044","volume":"4","author":"K. Pipatsrisawat","year":"2008","unstructured":"Pipatsrisawat, K., Palyan, A., Chavira, M., Choi, A., Darwiche, A.: Solving weighted Max-SAT problems in a reduced search space: A performance analysis. Journal on Satisfiability Boolean Modeling and Computation\u00a04, 191\u2013217 (2008)","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-74970-7_43","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M. Ram\u00edrez","year":"2007","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 605\u2013619. Springer, Heidelberg (2007)"},{"key":"16_CR25","unstructured":"Ryan, D., Foster, B.: An integer programming approach to scheduling. In: Computer Scheduling of Public Transport, pp. 269\u2013280 (1981)"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Sheini, H., Sakallah, K.: Pueblo: A Modern Pseudo-Boolean SAT Solver. In: Design, Automation and Testing in Europe Conference, pp. 684\u2013685 (March 2005)","DOI":"10.1109\/DATE.2005.246"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14186-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T19:42:07Z","timestamp":1591472527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14186-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141850","9783642141867"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14186-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}