{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:07:53Z","timestamp":1783397273529,"version":"3.54.6"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T00:00:00Z","timestamp":1717632000000},"content-version":"vor","delay-in-days":5,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hochschule f\u00fcr Technik und Wirtschaft Berlin"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes the computational challenge developed for a computational competition held in 2023 for the <jats:inline-formula><jats:alternatives><jats:tex-math>$$20{\\text {th}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>20<\/mml:mn>\n                    <mml:mtext>th<\/mml:mtext>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> anniversary of the Mixed Integer Programming Workshop. The topic of this competition was reoptimization, also known as warm starting, of mixed integer linear optimization problems after slight changes to the input data for a common formulation. The challenge was to accelerate the proof of optimality of the modified instances by leveraging the information from the solving processes of previously solved instances, all while creating high-quality primal solutions. Specifically, we discuss the competition\u2019s format, the creation of public and hidden datasets, and the evaluation criteria. Our goal is to establish a methodology for the generation of benchmark instances and an evaluation framework, along with benchmark datasets, to foster future research on reoptimization of mixed integer linear optimization problems.<\/jats:p>","DOI":"10.1007\/s12532-024-00256-w","type":"journal-article","created":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T12:02:24Z","timestamp":1717675344000},"page":"255-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The MIP Workshop 2023 Computational Competition on reoptimization"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5735-3443","authenticated-orcid":false,"given":"Suresh","family":"Bolusani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6284-3033","authenticated-orcid":false,"given":"Mathieu","family":"Besan\u00e7on","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-8154","authenticated-orcid":false,"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4040-0960","authenticated-orcid":false,"given":"Claudia","family":"D\u2019Ambrosio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-441X","authenticated-orcid":false,"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2930-3155","authenticated-orcid":false,"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0601-1790","authenticated-orcid":false,"given":"Dimitri","family":"Thomopulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,6]]},"reference":[{"key":"256_CR1","unstructured":"MIP computational competition 2023. https:\/\/github.com\/ambros-gleixner\/MIPcc23\/. Accessed: 1 Jun 2024 (2023)"},{"key":"256_CR2","unstructured":"MIP computational competition 2023 dataset generation scripts. https:\/\/github.com\/sbolusani\/MILP-WS-Lib. Accessed: 1 Jun 2024 (2023)"},{"key":"256_CR3","unstructured":"Mixed integer programming workshop series. https:\/\/www.mixedinteger.org\/#mipworkshops"},{"issue":"4","key":"256_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.07.009","journal-title":"Oper. Res. Lett."},{"key":"256_CR5","doi-asserted-by":"publisher","unstructured":"Andr\u00e9assian, V., Delaigue, O., Perrin, C., Janet, B., Addor, N.: CAMELS-FR: A large sample, hydroclimatic dataset for france, to support model testing and evaluation. In: EGU General Assembly Conference Abstracts (2021). https:\/\/doi.org\/10.5194\/egusphere-egu21-13349","DOI":"10.5194\/egusphere-egu21-13349"},{"issue":"3","key":"256_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/ijoc.2016.0695","volume":"28","author":"G Angulo","year":"2016","unstructured":"Angulo, G., Ahmed, S., Dey, S.S.: Improving the integer L-shaped method. INFORMS J. Comput. 28(3), 483\u2013499 (2016). https:\/\/doi.org\/10.1287\/ijoc.2016.0695","journal-title":"INFORMS J. Comput."},{"key":"256_CR7","doi-asserted-by":"publisher","unstructured":"Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and approximation in reoptimization. In: Computability in Context: Computation and Logic in the Real World, pp. 101\u2013129. World Scientific (2011). https:\/\/doi.org\/10.1142\/9781848162778_0004","DOI":"10.1142\/9781848162778_0004"},{"issue":"2","key":"256_CR8","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10107-020-01547-5","volume":"188","author":"T Berthold","year":"2021","unstructured":"Berthold, T., Csizmadia, Z.: The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers. Math. Program. 188(2), 523\u2013537 (2021). https:\/\/doi.org\/10.1007\/s10107-020-01547-5","journal-title":"Math. Program."},{"key":"256_CR9","doi-asserted-by":"publisher","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: Enabling research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. (2023). https:\/\/doi.org\/10.1145\/3585516","DOI":"10.1145\/3585516"},{"key":"256_CR10","doi-asserted-by":"publisher","DOI":"10.24432\/C52C8B","author":"R Bock","year":"2007","unstructured":"Bock, R.: MAGIC gamma telescope. UCI Mach. Learn. Repos. (2007). https:\/\/doi.org\/10.24432\/C52C8B","journal-title":"UCI Mach. Learn. Repos."},{"issue":"2","key":"256_CR11","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1137\/16M1076290","volume":"28","author":"N Boland","year":"2018","unstructured":"Boland, N., Christiansen, J., Dandurand, B., Eberhard, A., Linderoth, J., Luedtke, J., Oliveira, F.: Combining progressive hedging with a Frank-Wolfe method to compute Lagrangian dual bounds in stochastic mixed-integer programming. SIAM J. Optim. 28(2), 1312\u20131336 (2018). https:\/\/doi.org\/10.1137\/16M1076290","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"256_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10107-021-01763-7","volume":"196","author":"S Bolusani","year":"2022","unstructured":"Bolusani, S., Ralphs, T.K.: A framework for generalized Benders\u2019 decomposition and its application to multilevel optimization. Math. Program. 196(1\u20132), 389\u2013426 (2022). https:\/\/doi.org\/10.1007\/s10107-021-01763-7","journal-title":"Math. Program."},{"issue":"1","key":"256_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8e","year":"1999","unstructured":"Car\u00f8e, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1), 37\u201345 (1999). https:\/\/doi.org\/10.1016\/S0167-6377(98)00050-9","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"256_CR14","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/0377-2217(88)90034-3","volume":"35","author":"M Desrochers","year":"1988","unstructured":"Desrochers, M., Soumis, F.: A reoptimization algorithm for the shortest path problem with time windows. Eur. J. Oper. Res. 35(2), 242\u2013254 (1988). https:\/\/doi.org\/10.1016\/0377-2217(88)90034-3","journal-title":"Eur. J. Oper. Res."},{"key":"256_CR15","unstructured":"Energetici, G.M.: Historical data day ahead market (2022). https:\/\/www.mercatoelettrico.org\/En\/download\/DatiStorici.aspx"},{"key":"256_CR16","doi-asserted-by":"publisher","unstructured":"Etheve, M., Al\u00e8s, Z., Bissuel, C., Juan, O., Kedad-Sidhoum, S.: Reinforcement learning for variable selection in a branch and bound algorithm. In: E.\u00a0Hebrard, N.\u00a0Musliu (eds.) CPAIOR2020: Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer, Cham pp. 176\u2013185 (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_12","DOI":"10.1007\/978-3-030-58942-4_12"},{"key":"256_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104866","volume":"116","author":"M Firat","year":"2020","unstructured":"Firat, M., Crognier, G., Gabor, A.F., Hurkens, C., Zhang, Y.: Column generation based heuristic for learning classification trees. Comput. Oper. Res. 116, 104866 (2020). https:\/\/doi.org\/10.1016\/j.cor.2019.104866","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"256_CR18","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s12532-019-00159-1","volume":"11","author":"G Gamrath","year":"2019","unstructured":"Gamrath, G., Berthold, T., Heinz, S., Winkler, M.: Structure-driven fix-and-propagate heuristics for mixed integer programming. Math. Program. Comput. 11(4), 675\u2013702 (2019). https:\/\/doi.org\/10.1007\/s12532-019-00159-1","journal-title":"Math. Program. Comput."},{"issue":"3","key":"256_CR19","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","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.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"256_CR20","unstructured":"Hassanzadeh, A.: Two-stage stochastic mixed integer optimization. Ph.D. thesis, Lehigh University (2015)"},{"key":"256_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109570","volume":"253","author":"A Jim\u00e9nez-Cordero","year":"2022","unstructured":"Jim\u00e9nez-Cordero, A., Morales, J.M., Pineda, S.: Warm-starting constraint generation for mixed-integer optimization: a machine learning approach. Knowl.-Based Syst. 253, 109570 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.109570","journal-title":"Knowl.-Based Syst."},{"key":"256_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010: mixed integer programming library version 5. Math. Program. Comput. 3, 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"issue":"1","key":"256_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1090.0693","volume":"58","author":"L Ntaimo","year":"2010","unstructured":"Ntaimo, L.: Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse. Oper. Res. 58(1), 229\u2013243 (2010). https:\/\/doi.org\/10.1287\/opre.1090.0693","journal-title":"Oper. Res."},{"key":"256_CR24","doi-asserted-by":"publisher","unstructured":"Patel, K. K.: Progressively strengthening and tuning MIP solvers for reoptimization. Mathematical Programming Computation (2024). https:\/\/doi.org\/10.1007\/s12532-024-00253-z","DOI":"10.1007\/s12532-024-00253-z"},{"key":"256_CR25","unstructured":"Ralphs, T., G\u00fczelsoy, M.: Duality and warm starting in integer programming. In: The proceedings of the 2006 NSF design, service, and manufacturing grantees and research conference (2006). http:\/\/coral.ie.lehigh.edu\/~ted\/files\/papers\/DMII06.pdf"},{"key":"256_CR26","unstructured":"SAP SE or an SAP affiliate company: MILP benchmarks cellphoneco. (2023). https:\/\/github.com\/SAP-samples\/ibp-sop-benchmarks-milp-cellphoneco"},{"key":"256_CR27","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/s00453-017-0274-8","volume":"80","author":"B Schieber","year":"2018","unstructured":"Schieber, B., Shachnai, H., Tamir, G., Tamir, T.: A theory and algorithms for combinatorial reoptimization. Algorithmica 80, 576\u2013607 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0274-8","journal-title":"Algorithmica"},{"issue":"1","key":"256_CR28","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.04.019","volume":"207","author":"MW Tanner","year":"2010","unstructured":"Tanner, M.W., Ntaimo, L.: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207(1), 290\u2013296 (2010). https:\/\/doi.org\/10.1016\/j.ejor.2010.04.019","journal-title":"Eur. J. Oper. Res."},{"key":"256_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-023-00660-w","author":"D Thomopulos","year":"2023","unstructured":"Thomopulos, D., d\u2019Ambrosio, C., van Ackooij, W., St\u00e9fanon, M.: Generating hydro unit-commitment instances. TOP Off. J. Span. Soc. Stat. Oper. Res. (2023). https:\/\/doi.org\/10.1007\/s11750-023-00660-w","journal-title":"TOP Off. J. Span. Soc. Stat. Oper. Res."},{"key":"256_CR30","unstructured":"Witzig, J.: Reoptimization techniques in MIP solvers. Master\u2019s thesis. TU Berlin (2014)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00256-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-024-00256-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00256-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T16:19:20Z","timestamp":1720628360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-024-00256-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s12532-024-00256-w","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"3 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}