{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:11:33Z","timestamp":1743124293082,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030802226"},{"type":"electronic","value":"9783030802233"}],"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_21","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"299-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Projection Heuristics for Binary Branchings Between Sum and Product"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Kullmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Zaikin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2014.05.007","volume":"174","author":"T Ahmed","year":"2014","unstructured":"Ahmed, T., Kullmann, O., Snevily, H.: On the van der Waerden numbers $$\\rm w(2; 3, t)$$. Disc. Appl. Math. 174, 27\u201351 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.05.007","journal-title":"Disc. Appl. Math."},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Anderson, D., Bodic, P.L., Morgan, K.: Further results on an abstract model for branching and its application to mixed integer programming. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01556-4","DOI":"10.1007\/s10107-020-01556-4"},{"key":"21_CR3","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press (2009)"},{"issue":"1\u20132","key":"21_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-016-1101-8","volume":"166","author":"PL Bodic","year":"2017","unstructured":"Bodic, P.L., Nemhauser, G.L.: An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1\u20132), 369\u2013405 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1101-8","journal-title":"Math. Program."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","volume":"93","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es, T., Sadykov, R., Uchoa, E.: A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93, 66\u201378 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.01.016","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"21_CR6","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 5(7), 394\u2013397 (1962). https:\/\/doi.org\/10.1145\/368273.368557","journal-title":"Commun ACM"},{"key":"21_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. TTCSAES, Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2017.11.008","volume":"719","author":"A Golovnev","year":"2018","unstructured":"Golovnev, A., Kulikov, A.S., Smal, A.V., Tamaki, S.: Gate elimination: circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719, 46\u201363 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.11.008","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Marijn J. H. Heule and Hans van Maaren. Look-ahead based SAT solvers. In Biere et al. [3], chapter 5, pages 155\u2013184. https:\/\/doi.org\/10.3233\/978-1-58603-929-5-155","DOI":"10.3233\/978-1-58603-929-5-155"},{"issue":"8","key":"21_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/3107239","volume":"60","author":"MJH Heule","year":"2017","unstructured":"Heule, M.J.H., Kullmann, O.: The science of brute force. Commun. ACM 60(8), 25\u201334 (2017). https:\/\/doi.org\/10.1145\/3107239","journal-title":"Commun. ACM"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-63516-3_2","volume-title":"Handbook of Parallel Constraint Reasoning","author":"MJH Heule","year":"2018","unstructured":"Heule, M.J.H., Kullmann, O., Biere, A.: Cube-and-conquer for satisfiability. In: Handbook of Parallel Constraint Reasoning, pp. 31\u201359. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-63516-3_2"},{"key":"21_CR12","unstructured":"Hoorfar, A., Hassani, M.: Inequalities on the Lambert $${W}$$ function and hyperpower function. J. Inequalities Pure Appl. Math. 9(2), 1\u20135 (2008). https:\/\/www.emis.de\/journals\/JIPAM\/article983.html"},{"key":"21_CR13","unstructured":"Pinelis, I.: A certain generalisation of the golden ratio. MathOverflow. https:\/\/mathoverflow.net\/users\/36721\/iosif pinelis, https:\/\/mathoverflow.net\/q\/320595"},{"key":"21_CR14","unstructured":"Knuth, D.E.: The Art of Computer Programming, Satisfiability (Fascicle 6), vol. 4. Addison-Wesley, Boston (2015). ISBN-13 978\u20130134397603"},{"key":"21_CR15","unstructured":"Kullmann, O.: Obere und untere Schranken f\u00fcr die Komplexit\u00e4t von aussagenlogischen Resolutionsbeweisen und Klassen von SAT-Algorithmen. Master\u2019s thesis, Johann Wolfgang Goethe-Universit\u00e4t Frankfurt am Main (1992). (Upper and lower bounds for the complexity of propositional resolution proofs and classes of SAT algorithms (in German); Diplomarbeit am Fachbereich Mathematik)"},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Kullmann, O.: Fundaments of branching heuristics. In: Biere et al. [3], chap. 7, pp. 205\u2013244 (2007). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-205","DOI":"10.3233\/978-1-58603-929-5-205"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere et al. [3], chap. 4, pp. 131\u2013153 (1996). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-131","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"21_CR18","unstructured":"Olver, F.W.J., Lozier, D.W., Boisvert, R.F., Clark, C.W. (eds.): NIST Handbook of Mathematical Functions. NIST and Cambridge University Press, Cambridge (2010). ISBN 978-0-521-19225-5"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin, D., Pessoa, A.A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. Math. Program. Comput. 9(1), 61\u2013100 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0108-8","journal-title":"Math. Program. Comput."}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T23:34:04Z","timestamp":1625182444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}