{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:23:37Z","timestamp":1768688617523,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030802226","type":"print"},{"value":"9783030802233","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_23","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"332-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Local Search for Pseudo Boolean Optimization"],"prefix":"10.1007","author":[{"given":"Zhendong","family":"Lei","sequence":"first","affiliation":[]},{"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Hoos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"23_CR1","unstructured":"Barth, P.: A Davis-Putnam enumeration algorithm for linear pseudo-Boolean optimization. In: Technical Report MPI-I-95-2-003. Max Plank Institute for Computer Science (1995)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-19212-9_3","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"J Berg","year":"2019","unstructured":"Berg, J., Demirovi\u0107, E., Stuckey, P.J.: Core-boosted linear search for incomplete MaxSAT. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 39\u201356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_3"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-319-66158-2_29","volume-title":"Principles and Practice of Constraint Programming","author":"J Berg","year":"2017","unstructured":"Berg, J., Oikarinen, E., J\u00e4rvisalo, M., Puolam\u00e4ki, K.: Minimum-width confidence bands via constraint optimization. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 443\u2013459. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_29"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"103354","DOI":"10.1016\/j.artint.2020.103354","volume":"287","author":"S Cai","year":"2020","unstructured":"Cai, S., Lei, Z.: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artif. Intell. 287, 103354 (2020)","journal-title":"Artif. Intell."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Coudert, O., Madre, J.C.: New ideas for solving covering problems. In: Preas, B. (ed.) Proceedings of the 32st Conference on Design Automation, 1995, pp. 641\u2013646. ACM Press (1995)","DOI":"10.1145\/217474.217603"},{"key":"23_CR6","unstructured":"Devriendt, J., Gocht, S., Demirovi\u0107, E., Stuckey, P., Nordstr\u00f6m, J.: Cutting to the core of pseudo-Boolean optimization: combining core-guided search with cutting planes reasoning. In: AAAI 2021, Accepted (2021). http:\/\/www.csc.kth.se\/~jakobn\/research\/CuttingToTheCore_AAAI.pdf"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-94144-8_5","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"J Elffers","year":"2018","unstructured":"Elffers, J., Gir\u00e1ldez-Cru, J., Nordstr\u00f6m, J., Vinyals, M.: Using combinatorial benchmarks to probe the reasoning power of pseudo-boolean solvers. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 75\u201393. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_5"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Elffers, J., Nordstr\u00f6m, J.: Divide and conquer: towards faster pseudo-Boolean solving. In: Lang, J. (ed.) Proceedings of IJCAI 2018, pp. 1291\u20131299 (2018)","DOI":"10.24963\/ijcai.2018\/180"},{"key":"23_CR9","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2019). http:\/\/www.gurobi.com"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-58601-6_111","volume-title":"Principles and Practice of Constraint Programming","author":"JN Hooker","year":"1994","unstructured":"Hooker, J.N.: Logic-based methods for optimization. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 336\u2013349. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58601-6_111"},{"issue":"1","key":"23_CR11","first-page":"13","volume":"7","author":"LM Hvattum","year":"2012","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Glover, F.W.: Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0\u20131 integer programming problems. Algorithmic Oper. Res. 7(1), 13\u201320 (2012)","journal-title":"Algorithmic Oper. Res."},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Jussi, K., Kai, P., Aristides, G.: Confidence bands for time series data. In: Data Mining and Knowledge Discovery, pp. 1530\u20131553 (2014). https:\/\/doi.org\/10.1007\/s10618-014-0371-0","DOI":"10.1007\/s10618-014-0371-0"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kovasznai, G., Erdelyi, B., Biro, C.: 2018 IEEE International Conference on Future IoT Technologies (Future IoT) - Investigations of Graph Properties in Terms of Wireless Sen, pp. 1\u20138 (2018)","DOI":"10.1109\/FIOT.2018.8325588"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Kov\u00e1sznai, G., Gajd\u00e1r, K., Kov\u00e1cs, L.: Portfolio SAT and SMT solving of cardinality constraints in sensor network optimization. In: 21st SYNASC 2019, pp. 85\u201391. IEEE (2019)","DOI":"10.1109\/SYNASC49474.2019.00021"},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"23_CR16","first-page":"1141","volume":"2020","author":"Z Lei","year":"2020","unstructured":"Lei, Z., Cai, S., Luo, C.: Extended conjunctive normal form and an efficient algorithm for cardinality constraints. Proc. IJCAI 2020, 1141\u20131147 (2020)","journal-title":"Proc. IJCAI"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Liao, S.Y., Devadas, S.: Solving covering problems using lpr-based lower bounds. In: Yoffa, E.J., Micheli, G.D., Rabaey, J.M. (eds.) Proceedings of the 34st Conference on Design Automation, Anaheim, 1997, pp. 117\u2013120. ACM Press (1997)","DOI":"10.1109\/DAC.1997.597128"},{"issue":"1\u20134","key":"23_CR18","first-page":"103","volume":"2","author":"VM Manquinho","year":"2006","unstructured":"Manquinho, V.M., Roussel, O.: The first evaluation of pseudo-Boolean solvers (pb\u201905). J. Satisf. Boolean Model. Comput. 2(1\u20134), 103\u2013143 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"23_CR20","unstructured":"Martins, R., Sherry, J.: Lisbon wedding: seating arrangements using maxsat. In: MaxSAT Evaluation 2017: Solver and Benchmark Descriptions, pp. 25\u201326 (2017). http:\/\/hdl.handle.net\/10138\/228949"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 a library for encoding pseudo-boolean constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"key":"23_CR22","first-page":"7","volume":"2002","author":"S Prestwich","year":"2002","unstructured":"Prestwich, S.: Randomised backtracking for linear pseudo-Boolean constraint problems. Proc. CPAIOR 2002, 7\u201320 (2002)","journal-title":"Proc. CPAIOR"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Sakai, M., Nabeshima, H.: Construction of an ROBDD for a pb-constraint in band form and related techniques for pb-solvers. IEICE Trans. Inf. Syst. 98-D(6), 1121\u20131127 (2015)","DOI":"10.1587\/transinf.2014FOP0007"},{"key":"23_CR24","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: Rutenbar, R.A., Otten, R.H.J.M. (eds.) Proceedings of ICCAD 1996, pp. 220\u2013227. IEEE Computer Society ACM (1996)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T23:33:24Z","timestamp":1625182404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}