{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:17:52Z","timestamp":1774973872708,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M14ZAM, 05M20ZBM"],"award-info":[{"award-number":["05M14ZAM, 05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["EXC-2046\/1, project id 390685689"],"award-info":[{"award-number":["EXC-2046\/1, project id 390685689"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10601-022-09338-9","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T05:07:40Z","timestamp":1665551260000},"page":"432-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An algorithm-independent measure of progress for linear constraint propagation"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2252-9469","authenticated-orcid":false,"given":"Boro","family":"Sofranac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"9338_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T., Wunderling, R. (2013). In: J\u00fcnger, M., Reinelt, G. (eds.) Mixed Integer Programming: Analyzing 12 Years of Progress (pp. 449\u2013481). Springer https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18","DOI":"10.1007\/978-3-642-38189-8_18"},{"key":"9338_CR2","doi-asserted-by":"publisher","unstructured":"Koch, T., Martin, A., Pfetsch, M.E. (2013). In: J\u00fcnger, M., Reinelt, G. (eds.) Progress in Academic Computational Integer Programming (pp. 483\u2013506). Springer, Berlin https:\/\/doi.org\/10.1007\/978-3-642-38189-8_19","DOI":"10.1007\/978-3-642-38189-8_19"},{"issue":"3","key":"9338_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28(3), 497\u2013520.","journal-title":"Econometrica"},{"key":"9338_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., & Wolsey, L. (1988). Integer and Combinatorial Optimization. Wiley. https:\/\/doi.org\/10.1002\/9781118627372","journal-title":"Wiley"},{"key":"9338_CR5","unstructured":"Rossi, F., van Beek, P., Walsh, T. (2006). Handbook of Constraint Programming. Elsevier Science Inc"},{"key":"9338_CR6","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M. W. P. (1994). Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 6, 445\u2013454.","journal-title":"ORSA Journal on Computing"},{"key":"9338_CR7","unstructured":"Achterberg, T.: Constraint integer programming. PhD thesis, TU Berlin (2009)"},{"issue":"2","key":"9338_CR8","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R. E., Gu, Z., Rothberg, E., & Weninger, D. (2020). Presolve reductions in mixed integer programming. INFORMS Journal on Computing, 32(2), 473\u2013506. https:\/\/doi.org\/10.1287\/ijoc.2018.0857","journal-title":"INFORMS Journal on Computing"},{"key":"9338_CR9","doi-asserted-by":"publisher","unstructured":"Sofranac, B., Gleixner, A., Pokutta, S. (2020). Accelerating domain propagation: An efficient gpu-parallel algorithm over sparse matrices. In: 2020 IEEE\/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3) (pp. 1\u201311) https:\/\/doi.org\/10.1109\/IA351965.2020.00007","DOI":"10.1109\/IA351965.2020.00007"},{"key":"9338_CR10","doi-asserted-by":"publisher","unstructured":"Schulte, C., Stuckey, P.J. (2008). Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems\u00a031(1) https:\/\/doi.org\/10.1145\/1452044.1452046","DOI":"10.1145\/1452044.1452046"},{"issue":"1","key":"9338_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118. https:\/\/doi.org\/10.1016\/0004-3702(77)90007-8","journal-title":"Artificial Intelligence"},{"key":"9338_CR12","unstructured":"Mohr, R., Masini, G. (1988). Good old discrete relaxation. In: Proceedings of the 8th European Conference on Artificial Intelligence. ECAI\u201988 (pp. 651\u2013656). Pitman Publishing, Inc"},{"issue":"1","key":"9338_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P Van Hentenryck","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V., & Deville, Y. (1998). Design, implementation, and evaluation of the constraint language cc(fd). The Journal of Logic Programming, 37(1), 139\u2013164. https:\/\/doi.org\/10.1016\/S0743-1066(98)10006-7","journal-title":"The Journal of Logic Programming"},{"key":"9338_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5625.001.0001","author":"K Marriott","year":"1998","unstructured":"Marriott, K., & Stuckey, P. (1998). Programming with Constraints: An Introduction. The MIT Press. https:\/\/doi.org\/10.7551\/mitpress\/5625.001.0001","journal-title":"The MIT Press"},{"key":"9338_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11941439_9","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"CW Choi","year":"2006","unstructured":"Choi, C. W., Harvey, W., Lee, J. H. M., & Stuckey, P. J. (2006). Finite domain bounds consistency revisited. In A. Sattar & B.-H. Kang (Eds.), AI 2006: Advances in Artificial Intelligence (pp. 49\u201358). Springer."},{"issue":"1","key":"9338_CR16","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1613\/jair.3248","volume":"40","author":"L Bordeaux","year":"2011","unstructured":"Bordeaux, L., Katsirelos, G., Narodytska, N., & Vardi, M. Y. (2011). The complexity of integer bound propagation.\u00a0Journal of Artificial Intelligence Research, 40(1), 657\u2013676.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"9338_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation, 1(1), 1\u201341. https:\/\/doi.org\/10.1007\/s12532-008-0001-1","journal-title":"Mathematical Programming Computation"},{"key":"9338_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45749-6_11","volume-title":"Algorithms-ESA 2002","author":"E Althaus","year":"2002","unstructured":"Althaus, E., Bockmayr, A., Elf, M., J\u00fcnger, M., Kasper, T., & Mehlhorn, K. (2002). Scil-symbolic constraints in integer linear programming. In R. M\u00f6hring & R. Raman (Eds.), Algorithms-ESA 2002 (pp. 75\u201387). Springer."},{"key":"9338_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24664-0_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"I Aron","year":"2004","unstructured":"Aron, I., Hooker, J. N., & Yunes, T. H. (2004). Simpl: A system for integrating optimization techniques. In J.-C. R\u00e9gin & M. Rueher (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 21\u201336). Springer."},{"issue":"3","key":"9338_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"Branch and infer","year":"1998","unstructured":"Branch and infer. (1998). A unifying framework for integer and finite domain constraint programming. INFORMS J on Computing, 10(3), 287\u2013300. https:\/\/doi.org\/10.1287\/ijoc.10.3.287","journal-title":"INFORMS J on Computing"},{"issue":"4","key":"9338_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s12532-015-0083-5","volume":"7","author":"G Gamrath","year":"2015","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., & Weninger, D. (2015). Progress in presolving for mixed integer programming. Math Program Computer, 7(4), 367\u2013398.","journal-title":"Math Program Computer"},{"issue":"1","key":"9338_CR22","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-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"},{"issue":"2","key":"9338_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/a:1022323717928","volume":"8","author":"W Harvey","year":"2003","unstructured":"Harvey, W., & Stuckey, P. J. (2003). Improving linear constraint propagation by changing constraint representation. Constraints, 8(2), 173\u2013207. https:\/\/doi.org\/10.1023\/a:1022323717928","journal-title":"Constraints"},{"key":"9338_CR24","doi-asserted-by":"publisher","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L. (2010). Feasibility-based bounds tightening via fixed points. In: Wu, W., Daescu, O. (eds.) Combinatorial Optimization and Applications, Proc. of COCOA 2010 (pp. 65\u201376). Springer https:\/\/doi.org\/10.1007\/978-3-642-17458-2_7","DOI":"10.1007\/978-3-642-17458-2_7"},{"key":"9338_CR25","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric csps. In: Proceedings of the 13th International Joint Conference on Artifical Intelligence - Volume 1. IJCAI\u201993 (pp. 232\u2013238). Morgan Kaufmann Publishers Inc."},{"key":"9338_CR26","doi-asserted-by":"crossref","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J., L\u00fcbbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D., Shinano, Y. (2019). MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library. Technical report, Optimization Online http:\/\/www.optimization-online.org\/DB_HTML\/2019\/07\/7285.html. Accessed 23 July 2022.","DOI":"10.1007\/s12532-020-00194-3"},{"key":"9338_CR27","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., Le Bodic, P., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., 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. Accessed 23 July 2022."},{"key":"9338_CR28","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-89920-6_21","volume-title":"Operations Research Proceedings 2017","author":"M Miltenberger","year":"2018","unstructured":"Miltenberger, M., Ralphs, T., & Steffy, D. E. (2018). Exploring the numerics of branch-and-cut for mixed integer linear optimization. In N. Kliewer, J. F. Ehmke, & R. Bornd\u00f6rfer (Eds.), Operations Research Proceedings 2017 (pp. 151\u2013157). Springer."},{"key":"9338_CR29","doi-asserted-by":"crossref","unstructured":"Quarteroni, A., Sacco, R., Saleri, F. (2007). Numerical Mathematics. Texts in Applied Mathematics, vol. 37. Springer.","DOI":"10.1007\/978-0-387-22750-4"},{"key":"9338_CR30","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1090\/S0025-5718-1988-0935077-0","volume":"51","author":"B Fornberg","year":"1988","unstructured":"Fornberg, B. (1988). Generation of finite difference formulas on arbitrarily spaced grids. Mathematics of Computation, 51, 699\u2013706.","journal-title":"Mathematics of Computation"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09338-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-022-09338-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09338-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T09:29:15Z","timestamp":1669800555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-022-09338-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["9338"],"URL":"https:\/\/doi.org\/10.1007\/s10601-022-09338-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,12]]},"assertion":[{"value":"26 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}