{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T08:02:44Z","timestamp":1764403364268,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_20","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"310-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Certifying MIP-Based Presolve Reductions for\u00a0$$0$$\u2013$$1$$ Integer Linear Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1065-1651","authenticated-orcid":false,"given":"Alexander","family":"Hoen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9783-6768","authenticated-orcid":false,"given":"Andy","family":"Oertel","sequence":"additional","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":[[2024,5,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint Integer Programming. Doctoral thesis, Technische Universit\u00e4t Berlin, Fakult\u00e4t II - Mathematik und Naturwissenschaften, Berlin (2007). https:\/\/doi.org\/10.14279\/depositonce-1634","DOI":"10.14279\/depositonce-1634"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Achterberg, T., Bixby, R., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32 (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0857","DOI":"10.1287\/ijoc.2018.0857"},{"key":"20_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-319-98334-9_46","volume-title":"Principles and Practice of Constraint Programming","author":"\u00d6 Akg\u00fcn","year":"2018","unstructured":"Akg\u00fcn, \u00d6., Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Metamorphic testing of constraint solvers. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 727\u2013736. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_46"},{"key":"20_CR4","series-title":"LNCS","first-page":"1","volume-title":"Automated Deduction (CADE-29)","author":"J Berg","year":"2023","unstructured":"Berg, J., Bogaerts, B., Nordstr\u00f6m, J., Oertel, A., Vandesande, D.: Certified core-guided MaxSAT solving. In: Pientka, B., Tinelli, C. (eds.) CADE 2023. LNCS, vol. 14132, pp. 1\u201322. Springer, Cham (2023)"},{"key":"20_CR5","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2021","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 336, 2nd edn. IOS Press, Amsterdam (2021)","edition":"2"},{"key":"20_CR6","unstructured":"Biere, A., J\u00e4rvisalo, M., Kiesl, B.: Preprocessing in SAT solving. In: Biere et\u00a0al. [5], chap.\u00a09, pp. 391\u2013435"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Bogaerts, B., Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Certified symmetry and dominance breaking for combinatorial optimisation. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI\u00a02022), pp. 3698\u20133707 (Feb 2022)","DOI":"10.1609\/aaai.v36i4.20283"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1613\/jair.1.14296","volume":"77","author":"B Bogaerts","year":"2023","unstructured":"Bogaerts, B., Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Certified dominance and symmetry breaking for combinatorial optimisation. J. Artif. Intell. Res. 77, 1539\u20131589 (2023). preliminary version in AAAI 2022","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR9","unstructured":"Buss, S.R., Nordstr\u00f6m, J.: Proof complexity and SAT solving. In: Biere et\u00a0al. [5], chap.\u00a07, pp. 233\u2013350"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24(3), 305\u2013317 (2005). preliminary version in DAC\u00a0\u201903","DOI":"10.1109\/TCAD.2004.842808"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Chang, S.F., McCormick, S.T.: Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser. ACM Trans. Math. Softw. 19(3), 419-441 (1993). https:\/\/doi.org\/10.1145\/155743.152620","DOI":"10.1145\/155743.152620"},{"key":"20_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-59250-3_13","volume-title":"Integer Programming and Combinatorial Optimization. IPCO 2017","author":"KKH Cheung","year":"2017","unstructured":"Cheung, K.K.H., Gleixner, A.M., Steffy, D.E.: Verifying integer programming results. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 148\u2013160. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_13"},{"issue":"1","key":"20_CR13","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.: On the complexity of cutting-plane proofs. Discret. Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s12532-013-0055-6","volume":"5","author":"W Cook","year":"2013","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3), 305\u2013344 (2013)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s12532-013-0055-6","volume":"5","author":"W Cook","year":"2013","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3), 305\u2013344 (2013). https:\/\/doi.org\/10.1007\/s12532-013-0055-6","journal-title":"Math. Program. Comput."},{"key":"20_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-63046-5_14","volume-title":"Automated Deduction - CADE 26","author":"L Cruz-Filipe","year":"2017","unstructured":"Cruz-Filipe, L., Heule, M.J.H., Hunt, W.A., Kaufmann, M., Schneider-Kamp, P.: Efficient certified rat verification. In: de Moura, L. (ed.) CADE 2017. LNCS, pp. 220\u2013236. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_14"},{"key":"20_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-63046-5_14","volume-title":"Automated Deduction (CADE-26)","author":"L Cruz-Filipe","year":"2017","unstructured":"Cruz-Filipe, L., Heule, M.J.H., Hunt, W.A., Jr., Kaufmann, M., Schneider-Kamp, P.: Efficient certified RAT verification. In: de Moura, L. (ed.) CADE 2017. LNCS, vol. 10395, pp. 220\u2013236. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_14"},{"key":"20_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-662-54577-5_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Cruz-Filipe","year":"2017","unstructured":"Cruz-Filipe, L., Marques-Silva, J.P., Schneider-Kamp, P.: Efficient certified resolution proof checking. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 118\u2013135. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_7"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Devriendt, J.: Miplib 0-1 instances in opb format (2020). https:\/\/doi.org\/10.5281\/zenodo.3870965","DOI":"10.5281\/zenodo.3870965"},{"key":"20_CR20","unstructured":"Doornmalen, J.V., Eifler, L., Gleixner, A., Hojny, C.: A proof system for certifying symmetry and optimality reasoning in integer programming. Technical report 2311.03877, arXiv.org (2023)"},{"key":"20_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01749-5","author":"L Eifler","year":"2022","unstructured":"Eifler, L., Gleixner, A.: A computational status update for exact rational mixed integer programming. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01749-5","journal-title":"Math. Program."},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/23M156046X","volume":"34","author":"L Eifler","year":"2024","unstructured":"Eifler, L., Gleixner, A.: Safe and verified gomory mixed integer cuts in a rational MIP framework. SIAM J. Optim. 34(1), 742\u2013763 (2024). https:\/\/doi.org\/10.1137\/23M156046X","journal-title":"SIAM J. Optim."},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Eifler, L., Gleixner, A., Pulaj, J.: A safe computational framework for integer programming applied to chv\u00e1tal\u2019s conjecture. ACM Trans. Math. Softw. 48(2) (2022). https:\/\/doi.org\/10.1145\/3485630","DOI":"10.1145\/3485630"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"F\u00fcgenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol.\u00a012, pp. 69\u2013121. Elsevier (2005). https:\/\/doi.org\/10.1016\/S0927-0507(05)12002-7","DOI":"10.1016\/S0927-0507(05)12002-7"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. Math. Programm. Comput. 7 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0083-5","DOI":"10.1007\/s12532-015-0083-5"},{"issue":"3\u20134","key":"20_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s13675-020-00129-6","volume":"8","author":"P Gemander","year":"2020","unstructured":"Gemander, P., Chen, W.K., Weninger, D., Gottwald, L., Gleixner, A.: Two-row and two-column mixed-integer presolve using hashing-based pairing methods. EURO J. Comput. Optim. 8(3\u20134), 205\u2013240 (2020). https:\/\/doi.org\/10.1007\/s13675-020-00129-6","journal-title":"EURO J. Comput. Optim."},{"key":"20_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-030-30048-7_33","volume-title":"Principles and Practice of Constraint Programming","author":"X Gillard","year":"2019","unstructured":"Gillard, X., Schaus, P., Deville, Y.: SolverCheck: declarative testing of constraints. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 565\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_33"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Gleixner, A., Gottwald, L., Hoen, A.: PaPILO: a parallel presolving library for integer and linear programming with multiprecision support. INFORMS J. Comput. (2023). https:\/\/doi.org\/10.1287\/ijoc.2022.0171.cd, https:\/\/github.com\/INFORMSJoC\/2022.0171","DOI":"10.1287\/ijoc.2022.0171.cd"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13, 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"20_CR30","unstructured":"Gocht, S., Oertel, A.: Veripb (2023). https:\/\/gitlab.com\/MIAOresearch\/software\/VeriPB, githash: dd7aa5a1"},{"key":"20_CR31","unstructured":"Gocht, S., Martins, R., Nordstr\u00f6m, J., Oertel, A.: Certified CNF translations for pseudo-Boolean solving. In: Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT\u00a02022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0236, pp. 16:1\u201316:25 (Aug 2022)"},{"key":"20_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-58475-7_20","volume-title":"Principles and Practice of Constraint Programming CP 2020","author":"S Gocht","year":"2020","unstructured":"Gocht, S., McBride, R., McCreesh, C., Nordstr\u00f6m, J., Prosser, P., Trimble, J.: Certifying solvers for clique and maximum common (connected) subgraph problems. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 338\u2013357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_20"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Subgraph isomorphism meets cutting planes: Solving with certified solutions. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI\u00a0\u201920), pp. 1134\u20131140 (2020)","DOI":"10.24963\/ijcai.2020\/158"},{"key":"20_CR34","unstructured":"Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: An auditable constraint programming solver. In: Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming (CP\u00a0\u201922). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0235, pp. 25:1\u201325:18 (2022)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Gocht, S., Nordstr\u00f6m, J.: Certifying parity reasoning efficiently using pseudo-Boolean proofs. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI\u00a0\u201921), pp. 3768\u20133777 (2021)","DOI":"10.1609\/aaai.v35i5.16494"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Hunt\u00a0Jr., W.A., Wetzler, N.: Trimming while checking clausal proofs. In: Proceedings of the 13th International Conference on Formal Methods in Computer-Aided Design (FMCAD\u00a0\u201913), pp. 181\u2013188 (2013)","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-38574-2_24","volume-title":"Automated Deduction \u2013 CADE-24","author":"MJH Heule","year":"2013","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Verifying refutations with extended resolution. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 345\u2013359. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_24"},{"key":"20_CR38","unstructured":"Hoen, A.: Papilo: Parallel presolve integer and linear optimization (2023). https:\/\/github.com\/scipopt\/papilo\/tree\/develop\/check\/VeriPB, githash: 5df3dd6d"},{"key":"20_CR39","unstructured":"Hoen, A., Gottwald, L.: Papilo: parallel presolve integer and linear optimization (2023). https:\/\/github.com\/scipopt\/papilo, githash: 3b082d4"},{"key":"20_CR40","doi-asserted-by":"publisher","unstructured":"Klotz, E.: Identification, assessment, and correction of ill-conditioning and numerical instability in linear and integer programs. In: Newman, A., Leung, J. (eds.) Bridging Data and Decisions, pp. 54\u2013108. TutORials in Operations Research (2014). https:\/\/doi.org\/10.1287\/educ.2014.0130","DOI":"10.1287\/educ.2014.0130"},{"key":"20_CR41","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-51825-7_23","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2020","author":"D Le Berre","year":"2020","unstructured":"Le Berre, D., Marquis, P., Wallon, R.: On weakening strategies for PB solvers. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, pp. 322\u2013331. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_23"},{"key":"20_CR42","unstructured":"McIlree, M., McCreesh, C.: Proof logging for smart extensional constraints. In: Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP\u00a0\u201923). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0280, pp. 26:1\u201326:17 (2023)"},{"key":"20_CR43","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC\u00a0\u201901), pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"20_CR44","unstructured":"PaPILO \u2014 parallel presolve for integer and linear optimization. https:\/\/github.com\/lgottwald\/PaPILO"},{"key":"20_CR45","unstructured":"Roussel, O.: Pseudo-boolean competition 2016 (2016). http:\/\/www.cril.univ-artois.fr\/PB16\/"},{"key":"20_CR46","doi-asserted-by":"publisher","unstructured":"Sahraoui, Y., Bendotti, P., D\u2019Ambrosio, C.: Real-world hydro-power unit-commitment: dealing with numerical errors and feasibility issues. Energy 184, 91\u2013104 (2019). https:\/\/doi.org\/10.1016\/j.energy.2017.11.064, shaping research in gas-, heat- and electric- energy infrastructures","DOI":"10.1016\/j.energy.2017.11.064"},{"key":"20_CR47","doi-asserted-by":"publisher","unstructured":"Savelsbergh, M.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6 (1994).https:\/\/doi.org\/10.1287\/ijoc.6.4.445","DOI":"10.1287\/ijoc.6.4.445"},{"key":"20_CR48","doi-asserted-by":"crossref","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: a hybrid pseudo-Boolean SAT solver. J. Satisfiability, Boolean Model. Comput. 2(1\u20134), 165\u2013189 (2006). preliminary version in DATE\u00a0\u201905","DOI":"10.3233\/SAT190020"},{"key":"20_CR49","unstructured":"Steffy, D.E.: Topics in exact precision mathematical programming. Ph.D. thesis, Georgia Institute of Technology (2011). http:\/\/hdl.handle.net\/1853\/39639"},{"key":"20_CR50","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-031-15707-3_33","volume-title":"Logic Programming and Non-monotonic Reasoning","author":"D Vandesande","year":"2022","unstructured":"Vandesande, D., De Wulf, W., Bogaerts, B.: QMaxSATpb: a certified MaxSAT solver. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) LPNMR 2022. LNCS, vol. 13416, pp. 429\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_33"},{"key":"20_CR51","unstructured":"Weninger, D.: Solving mixed-integer programs arising in production planning. Phd thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (2016)"},{"key":"20_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-09284-3_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"N Wetzler","year":"2014","unstructured":"Wetzler, N., Heule, M.J.H., Hunt, W.A.: DRAT-trim: efficient checking and trimming using expressive clausal proofs. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 422\u2013429. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_31"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60597-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:06:46Z","timestamp":1716818806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}