{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:52:56Z","timestamp":1768096376649,"version":"3.49.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"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":["Constraints"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10601-020-09318-x","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T04:24:24Z","timestamp":1610943864000},"page":"26-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6346-3665","authenticated-orcid":false,"given":"Jo","family":"Devriendt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2700-4285","authenticated-orcid":false,"given":"Jakob","family":"Nordstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"issue":"1","key":"9318_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T. (2007). Conflict analysis in mixed integer programming. Discrete Optimization, 4(1), 4\u201320.","journal-title":"Discrete Optimization"},{"key":"9318_CR2","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Berthold, T., Koch, T., & Wolter, K. (2008). Constraint integer programming: a new approach to integrate CP and MIP. In Proceedings of the 5th International conference on the integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR \u201908). Lecture notes in computer science, (Vol. 5015 pp. 6\u201320): Springer.","DOI":"10.1007\/978-3-540-68155-7_4"},{"key":"9318_CR3","doi-asserted-by":"crossref","unstructured":"Achterberg, T., & Wunderling, R. (2013). Mixed integer programming: Analyzing 12 years of progress. In J\u00fcnger, M., & Reinelt, G. (Eds.) Facets of combinatorial optimization (pp. 449\u2013481): Springer.","DOI":"10.1007\/978-3-642-38189-8_18"},{"key":"9318_CR4","unstructured":"Audemard, G., & Simon, L. (2009). Predicting learnt clauses quality in modern SAT solvers. In Proceedings of the 21st International joint conference on artificial intelligence (IJCAI \u201909) (pp. 399\u2013 404)."},{"key":"9318_CR5","volume-title":"Logic-based 0\u20131 constraint programming, operations research\/computer science interfaces series, Vol. 5","author":"P Barth","year":"1996","unstructured":"Barth, P. (1996). Logic-based 0\u20131 constraint programming, operations research\/computer science interfaces series Vol. 5. Berlin: Springer."},{"key":"9318_CR6","unstructured":"Barth, P., & Bockmayr, A. (1995). Finite domain and cutting plane techniques in CLP(PB). In Proceedings of the 12th international conference on logic programming (pp. 133\u2013147). Cambridge: MIT Press."},{"key":"9318_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1023\/A:1018981813157","volume":"81","author":"P Barth","year":"1998","unstructured":"Barth, P., & Bockmayr, A. (1998). Modelling discrete optimisation problems in constraint logic programming. Annals of Operations Research, 81, 467\u2013496.","journal-title":"Annals of Operations Research"},{"key":"9318_CR8","unstructured":"Bayardo Jr., R.J., & Schrag, R. (1997). Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th national conference on artificial intelligence (AAAI \u201997) (pp. 203\u2013208)."},{"key":"9318_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P Beame","year":"2004","unstructured":"Beame, P., Kautz, H., & Sabharwal, A. (2004). Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22, 319\u2013351. preliminary version in IJCAI \u201903.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"9318_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00493-004-0036-5","volume":"24","author":"E Ben-Sasson","year":"2004","unstructured":"Ben-Sasson, E., Impagliazzo, R., & Wigderson, A. (2004). Near optimal separation of tree-like and general resolution. Combinatorica, 24(4), 585\u2013603.","journal-title":"Combinatorica"},{"issue":"2","key":"9318_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., & Wigderson, A. (2001). Short proofs are narrow\u2014resolution made simple. Journal of the ACM, 48(2), 149\u2013169. preliminary version in STOC \u201999.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9318_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R Bixby","year":"2007","unstructured":"Bixby, R., & Rothberg, E. (2007). Progress in computational mixed integer programming\u2014 A look back from the other side of the tipping point. Annals of Operations Research, 149(1), 37\u201341.","journal-title":"Annals of Operations Research"},{"key":"9318_CR13","unstructured":"Blake, A. (1937). Canonical expressions in boolean algebra. Ph.D. thesis, University of Chicago."},{"key":"9318_CR14","doi-asserted-by":"crossref","unstructured":"Bockmayr, A. (1995). Solving pseudo-Boolean constraints. In Constraint programming: Basics and trends. TCS school 1994. Lecture notes in computer science, (Vol. 910 pp. 22\u201338): Springer.","DOI":"10.1007\/3-540-59155-9_2"},{"key":"9318_CR15","doi-asserted-by":"crossref","unstructured":"Buss, S.R., & Nordstr\u00f6m, J. Proof complexity and SAT solving. In Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.), Handbook of Satisfiability, chap. 7 (pp. 233\u2013350). Frontiers in Artificial Intelligence and Applications, IOS Press, 2nd edn. (2021), to appear. Currently available at http:\/\/www.csc.kth.se\/jakobn\/research\/.","DOI":"10.3233\/FAIA200990"},{"key":"9318_CR16","doi-asserted-by":"crossref","unstructured":"Calabro, C., Impagliazzo, R., & Paturi, R. (2009). The complexity of satisfiability of small depth circuits. In Revised selected papers from the 4th international workshop on parameterized and exact computation (IWPEC \u201909). Lecture notes in computer science, (Vol. 5917 pp. 75\u201385): Springer.","DOI":"10.1007\/978-3-642-11269-0_6"},{"issue":"3","key":"9318_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCAD.2004.842808","volume":"24","author":"D Chai","year":"2005","unstructured":"Chai, D., & Kuehlmann, A. (2005). A fast pseudo-Boolean constraint solver. IEEE transactions on computer-aided design of integrated circuits and systems, 24(3), 305\u2013317. preliminary version in DAC \u201903.","journal-title":"IEEE transactions on computer-aided design of integrated circuits and systems"},{"key":"9318_CR18","doi-asserted-by":"crossref","unstructured":"Cook, S. A. (1971). The complexity of theorem-proving procedures. In Proceedings of the 3rd annual ACM symposium on theory of computing (STOC \u201971) (pp. 151\u2013158).","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"9318_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W Cook","year":"1987","unstructured":"Cook, W., Coullard, C. R., & Tur\u00e1n, G. (1987). On the complexity of cutting-plane proofs. Discrete Applied Mathematics, 18(1), 25\u201338.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"9318_CR20","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/ijoc.1090.0324","volume":"21","author":"W Cook","year":"2009","unstructured":"Cook, W., Dash, S., Fukasawa, R., & Goycoolea, M. (2009). Numerically safe Gomory mixed-integer cuts. INFORMS Journal on Computing, 21 (4), 641\u2013649.","journal-title":"INFORMS Journal on Computing"},{"key":"9318_CR21","doi-asserted-by":"publisher","DOI":"10.7249\/R366","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig, G. (1963). Linear programming and extensions. Princeton: Princeton University Press."},{"issue":"7","key":"9318_CR22","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. (1962). A machine program for theorem proving. Communications of the ACM, 5(7), 394\u2013397.","journal-title":"Communications of the ACM"},{"issue":"3","key":"9318_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7(3), 201\u2013215.","journal-title":"Journal of the ACM"},{"key":"9318_CR24","doi-asserted-by":"crossref","unstructured":"Demirovi\u0107, E., Chu, G., & Stuckey, P.J. (2018). Solution-based phase saving for CP: a value-selection heuristic to simulate local search behavior in complete solvers. In Proceedings of the 24th international conference on principles and practice of constraint programming (CP \u201918). Lecture notes in computer science, (Vol. 11008 pp. 99\u2013108): Springer.","DOI":"10.1007\/978-3-319-98334-9_7"},{"key":"9318_CR25","doi-asserted-by":"publisher","unstructured":"Devriendt, J., Gleixner, A., Nordstr\u00f6m, J, & Nordstr\u00f6m J. (2020). Experimental Repository for \u201cLearn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search\u201d. https:\/\/doi.org\/10.5281\/zenodo.3945412.","DOI":"10.5281\/zenodo.3945412"},{"key":"9318_CR26","unstructured":"Dixon, H. E., & Ginsberg, M. L. (2002). Inference methods for a pseudo-Boolean satisfiability solver. In Proceedings of the 18th national conference on artificial intelligence (AAAI \u201902) (pp. 635\u2013640)."},{"key":"9318_CR27","unstructured":"Downing, N.R. (2016). Scheduling and rostering with learning constraint solvers. Ph.D. thesis, University of Melbourne, available at https:\/\/minerva-access.unimelb.edu.au\/handle\/11343\/129704."},{"key":"9318_CR28","doi-asserted-by":"crossref","unstructured":"Dutertre, B., & de Moura, L. (2006). A fast linear-arithmetic solver for DPLL(t). In Proceedings of the 18th international conference on computer aided verification (CAV \u201906). Lecture notes in computer science, (Vol. 4144 pp. 81\u201394): Springer.","DOI":"10.1007\/11817963_11"},{"issue":"1-4","key":"9318_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2006). Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2 (1-4), 1\u201326.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9318_CR30","doi-asserted-by":"crossref","unstructured":"Elffers, J., Gir\u00e1ldez-cru, J., Nordstr\u00f6m, J., & Vinyals, M. (2018). Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers. In Proceedings of the 21st international conference on theory and applications of satisfiability testing (SAT \u201918). Lecture Notes in computer science, (Vol. 10929 pp. 75\u201393): Springer.","DOI":"10.1007\/978-3-319-94144-8_5"},{"key":"9318_CR31","doi-asserted-by":"crossref","unstructured":"Elffers, J., & Nordstr\u00f6m, J. (2018). Divide and conquer: Towards faster pseudo-Boolean solving. In Proceedings of the 27th international joint conference on artificial intelligence (IJCAI \u201918) (pp. 1291\u20131299).","DOI":"10.24963\/ijcai.2018\/180"},{"key":"9318_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/crll.1902.124.1","volume":"1902","author":"J Farkas","year":"1902","unstructured":"Farkas, J. (1902). \u00dcBer die Theorie der einfachen Ungleichungen. Journal fur die reine und angewandte Mathematik, 1902, 1\u201327. https:\/\/doi.org\/10.1515\/crll.1902.124.1.","journal-title":"Journal fur die reine und angewandte Mathematik"},{"issue":"2","key":"9318_CR33","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","volume":"262","author":"F Furini","year":"2017","unstructured":"Furini, F., Ljubi\u0107, I., & Sinnl, M. (2017). An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. European Journal of Operational Research, 262(2), 438\u2013448.","journal-title":"European Journal of Operational Research"},{"key":"9318_CR34","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Bodic, P.L., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., & Witzig, J. (2020). The SCIP Optimization Suite 7.0. Technical report, Optimization Online. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html."},{"key":"9318_CR35","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187\u2013188","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., & Schaub, T. (2012). Conflict-driven answer set solving: From theory to practice. Artificial Intelligence, 187\u2013188, 52\u201389.","journal-title":"Artificial Intelligence"},{"key":"9318_CR36","unstructured":"Gurobi optimizer. https:\/\/www.gurobi.com\/."},{"issue":"2-3","key":"9318_CR37","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A Haken","year":"1985","unstructured":"Haken, A. (1985). The intractability of resolution. Theoretical Computer Science, 39(2-3), 297\u2013308.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9318_CR38","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02186368","volume":"12","author":"JN Hooker","year":"1988","unstructured":"Hooker, J.N. (1988). Generalized resolution and cutting planes. Annals of Operations Research, 12(1), 217\u2013239.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"9318_CR39","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"JN Hooker","year":"1992","unstructured":"Hooker, J.N. (1992). Generalized resolution for 0-1 linear inequalities. Annals of Mathematics and Artificial Intelligence, 6(1), 271\u2013286.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9318_CR40","unstructured":"IBM ILOG CPLEX optimization studio. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio."},{"issue":"2","key":"9318_CR41","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., & Paturi, R. (2001). On the complexity of k-SAT. Journal of Computer and System Sciences, 62(2), 367\u2013375. preliminary version in CCC \u201999.","journal-title":"Journal of Computer and System Sciences"},{"key":"9318_CR42","doi-asserted-by":"crossref","unstructured":"J\u00e4rvisalo, M., Matsliah, A., Nordstr\u00f6m, J., & \u017eivn\u00fd, S. (2012). Relating proof complexity measures and practical hardness of SAT. In Proceedings of the 18th international conference on principles and practice of constraint programming (CP \u201912). Lecture notes in computer science, (Vol. 7514 pp. 316\u2013331): Springer.","DOI":"10.1007\/978-3-642-33558-7_25"},{"key":"9318_CR43","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D Le Berre","year":"2010","unstructured":"Le Berre, D., & Parrain, A. (2010). The Sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation, 7, 59\u201364.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"3","key":"9318_CR44","first-page":"115","volume":"9","author":"LA Levin","year":"1973","unstructured":"Levin, L.A. (1973). Universal sequential search problems. Problemy peredachi informatsii, 9(3), 115\u2013116. in Russian. Available at http:\/\/mi.mathnet.ru\/ppi914.","journal-title":"Problemy peredachi informatsii"},{"issue":"5","key":"9318_CR45","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/43.998623","volume":"21","author":"VM Manquinho","year":"2006","unstructured":"Manquinho, V.M., & Marques-Silva, J.P. (2006). Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem. IEEE Transactions on Computer-Aided Design, 21(5), 505\u2013516.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"9318_CR46","unstructured":"Marchand, H., & Wolsey, L. (1998). Aggregation and mixed integer rounding to solve MIPs."},{"issue":"5","key":"9318_CR47","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., & Sakallah, K.A. (1999). GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5), 506\u2013521. preliminary version in ICCAD \u201996.","journal-title":"IEEE Transactions on Computers"},{"key":"9318_CR48","doi-asserted-by":"crossref","unstructured":"Martins, R., Manquinho, V. M., & Lynce, I. (2014). Open-WBO: A modular maxSAT solver. In Proceedings of the 17th international conference on theory and applications of satisfiability testing (SAT \u201914). Lecture notes in computer science, (Vol. 8561 pp. 438\u2013445): Springer.","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"9318_CR49","unstructured":"MIPLIB 2017 (2018), http:\/\/miplib.zib.de."},{"key":"9318_CR50","unstructured":"Mitchell, J. (2002). Branch-and-cut algorithms for combinatorial optimization problems. Handbook of Applied Optimization, 65\u201377."},{"key":"9318_CR51","doi-asserted-by":"crossref","unstructured":"Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th design automation conference (DAC \u201901), 530\u2013535.","DOI":"10.1145\/378239.379017"},{"issue":"3","key":"9318_CR52","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.2168\/LMCS-9(3:15)2013","volume":"9","author":"J Nordstr\u00f6m","year":"2013","unstructured":"Nordstr\u00f6m, J. (2013). Pebble games, proof complexity and time-space trade-offs. Logical Methods in Computer Science, 9(3), 15:1\u201315:63.","journal-title":"Logical Methods in Computer Science"},{"key":"9318_CR53","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., & Darwiche, A. (2007). A lightweight component caching scheme for satisfiability solvers. In Proceedings of the 10th international conference on theory and applications of satisfiability testing (SAT \u201907). Lecture Notes in computer science, (Vol. 4501 pp. 294\u2013299): Springer.","DOI":"10.1007\/978-3-540-72788-0_28"},{"issue":"9","key":"9318_CR54","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D. (2005). Where are the hard knapsack problems? Computers & Operations Research, 32(9), 2271\u20132284.","journal-title":"Computers & Operations Research"},{"key":"9318_CR55","unstructured":"Pseudo-Boolean competition 2016. http:\/\/www.cril.univ-artois.fr\/PB16\/ (2016)."},{"issue":"1","key":"9318_CR56","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 23\u201341.","journal-title":"Journal of the ACM"},{"key":"9318_CR57","unstructured":"RoundingSat. https:\/\/gitlab.com\/miao_research\/roundingsat."},{"key":"9318_CR58","unstructured":"Roussel, O., & Manquinho, V.M. (2016). Input\/output format and solver requirements for the competitions of pseudo-Boolean solvers, revision 2324. Available at http:\/\/www.cril.univ-artois.fr\/PB16\/format.pdf."},{"issue":"6","key":"9318_CR59","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1587\/transinf.2014FOP0007","volume":"98-D","author":"M Sakai","year":"2015","unstructured":"Sakai, M., & Nabeshima, H. (2015). Construction of an ROBDD for a PB-constraint in band form and related techniques for PB-solvers. IEICE Transactions on Information and Systems, 98-D(6), 1121\u20131127.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"9318_CR60","unstructured":"Sandholm, T., & Shields, R. (2006). Nogood learning for mixed integer programming. In Workshop on hybrid methods and branching rules in combinatorial optimization."},{"key":"9318_CR61","unstructured":"The international SAT Competitions web page. http:\/\/www.satcompetition.org."},{"issue":"1-4","key":"9318_CR62","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/SAT190020","volume":"2","author":"HM Sheini","year":"2006","unstructured":"Sheini, H.M., & Sakallah, K.A. (2006). Pueblo: A hybrid pseudo-Boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 2 (1-4), 165\u2013189. preliminary version in DATE \u201905.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9318_CR63","doi-asserted-by":"crossref","unstructured":"Shen, K., & Schimpf, J. (Oct 2005). Eplex: Harnessing mathematical programming solvers for constraint logic programming. In Proceedings of the 11th international conference on principles and practice of constraint programming (CP \u201905). Lecture notes in computer science, (Vol. 3709 pp. 622\u2013636): Springer.","DOI":"10.1007\/11564751_46"},{"key":"9318_CR64","volume-title":"Linear programming: Foundations and extensions","author":"RJ Vanderbei","year":"1996","unstructured":"Vanderbei, R.J. (1996). Linear programming: Foundations and extensions. US: Springer."},{"key":"9318_CR65","doi-asserted-by":"crossref","unstructured":"Vinyals, M., Elffers, J., Gir\u00e1ldez-cru, J., Gocht, S., & Nordstr\u00f6m, J. (2018). In between resolution and cutting planes: A study of proof systems for pseudo-Boolean SAT solving. In Proceedings of the 21st international conference on theory and applications of satisfiability testing (SAT \u201918). Lecture notes in computer science, (Vol. 10929 pp. 292\u2013310): Springer.","DOI":"10.1007\/978-3-319-94144-8_18"},{"key":"9318_CR66","unstructured":"Wesselmann, F., & Suhl, U.H. (2012). Implementing cutting plane management and selection techniques. Technical report, Optimization Online, http:\/\/www.optimization-online.org\/DB_HTML\/2012\/12\/3714.html."},{"key":"9318_CR67","unstructured":"Zhou, N., Tsuru, M., & Nobuyama, E. (2012). A comparison of CP, IP, and SAT solvers through a common interface. In Proceedings of the 24th IEEE international conference on tools with artificial intelligence (ICTAI \u201912) (pp. 41\u201348)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-020-09318-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-020-09318-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-020-09318-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T13:05:36Z","timestamp":1638623136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-020-09318-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":67,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["9318"],"URL":"https:\/\/doi.org\/10.1007\/s10601-020-09318-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,18]]},"assertion":[{"value":"12 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}