{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:48:37Z","timestamp":1778586517031,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000761","name":"Imperial College London","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000761","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n<jats:p>We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional problems that require a finite-dimensional approximation, and (ii) the presence of discrete recourse decisions typically prohibits duality-based solution schemes. We address the first challenge by studying a <jats:italic>K<\/jats:italic>-adaptability formulation that selects <jats:italic>K<\/jats:italic> candidate recourse policies <jats:italic>before<\/jats:italic> observing the realization of the uncertain parameters and that implements the best of these policies <jats:italic>after<\/jats:italic> the realization is known. We address the second challenge through a branch-and-bound scheme that enjoys asymptotic convergence in general and finite convergence under specific conditions. We illustrate the performance of our algorithm in numerical experiments involving benchmark data from several application domains.\n<\/jats:p>","DOI":"10.1007\/s12532-019-00174-2","type":"journal-article","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T13:03:30Z","timestamp":1573045410000},"page":"193-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["K-adaptability in two-stage mixed-integer robust optimization"],"prefix":"10.1007","volume":"12","author":[{"given":"Anirudh","family":"Subramanyam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chrysanthos E.","family":"Gounaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfram","family":"Wiesemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"issue":"2","key":"174_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10287-016-0249-2","volume":"13","author":"J Ayoub","year":"2016","unstructured":"Ayoub, J., Poss, M.: Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Manag. Sci. 13(2), 219\u2013239 (2016)","journal-title":"Comput. Manag. Sci."},{"key":"174_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"2","key":"174_CR3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351\u2013376 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"174_CR4","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"12","key":"174_CR5","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/TAC.2010.2049764","volume":"55","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Caramanis, C.: Finite adaptibility in multistage linear optimization. IEEE Trans. Autom. Control 55(12), 2751\u20132766 (2010)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"174_CR6","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1287\/opre.2016.1515","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., Dunning, I.: Multistage robust mixed integer optimization with adaptive partitions. Oper. Res. 64(4), 980\u2013998 (2016)","journal-title":"Oper. Res."},{"issue":"3","key":"174_CR7","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1287\/opre.2015.1365","volume":"63","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., Georghiou, A.: Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 63(3), 610\u2013627 (2015)","journal-title":"Oper. Res."},{"issue":"2","key":"174_CR8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10107-017-1135-6","volume":"167","author":"D Bertsimas","year":"2018","unstructured":"Bertsimas, D., Georghiou, A.: Binary decision rules for multistage adaptive mixed-integer optimization. Math. Program. 167(2), 395\u2013433 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"174_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.1110.0482","volume":"36","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Goyal, V., Sun, X.A.: A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization. Math. Oper. Res. 36(1), 24\u201354 (2011)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"174_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/TPWRS.2012.2205021","volume":"28","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Litvinov, E., Sun, X.A., Zhao, J., Zheng, T.: Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans. Power Syst. 28(1), 52\u201363 (2013)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"174_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00934096","volume":"19","author":"JW Blankenship","year":"1976","unstructured":"Blankenship, J.W., Falk, J.E.: Infinitely constrained optimization problems. J. Optim. Theory Appl. 19(2), 261\u2013281 (1976)","journal-title":"J. Optim. Theory Appl."},{"key":"174_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.endm.2016.03.007","volume":"52","author":"C Buchheim","year":"2016","unstructured":"Buchheim, C., Kurtz, J.: Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. Electron Notes Discrete Math. 52, 45\u201352 (2016)","journal-title":"Electron Notes Discrete Math."},{"issue":"1","key":"174_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1053-z","volume":"163","author":"C Buchheim","year":"2017","unstructured":"Buchheim, C., Kurtz, J.: Min\u2013max\u2013min robust combinatorial optimization. Math. Program. 163(1), 1\u201323 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"174_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disopt.2017.08.006","volume":"28","author":"C Buchheim","year":"2018","unstructured":"Buchheim, C., Kurtz, J.: Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. Discrete Optim. 28(1), 1\u201315 (2018)","journal-title":"Discrete Optim."},{"issue":"6","key":"174_CR15","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"X Chen","year":"2009","unstructured":"Chen, X., Zhang, Y.: Uncertain linear programs: extended affinely adjustable robust counterparts. Oper. Res. 57(6), 1469\u20131482 (2009)","journal-title":"Oper. Res."},{"issue":"3","key":"174_CR16","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","volume":"235","author":"V Gabrel","year":"2014","unstructured":"Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: an overview. Eur. J. Oper. Res. 235(3), 471\u2013483 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"174_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0789-6","volume":"152","author":"A Georghiou","year":"2015","unstructured":"Georghiou, A., Wiesemann, W., Kuhn, D.: Generalized decision rule approximations for stochastic programming via liftings. Math. Program. 152(1), 301\u2013338 (2015)","journal-title":"Math. Program."},{"issue":"4","key":"174_CR18","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1287\/opre.1090.0795","volume":"58","author":"J Goh","year":"2010","unstructured":"Goh, J., Sim, M.: Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4), 902\u2013917 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"174_CR19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2012.10.007","volume":"227","author":"BL Gorissen","year":"2013","unstructured":"Gorissen, B.L., den Hertog, D.: Robust counterparts of inequalities containing sums of maxima of linear functions. Eur. J. Oper. Res. 227(1), 30\u201343 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"174_CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.omega.2014.12.006","volume":"53","author":"BL Gorissen","year":"2015","unstructured":"Gorissen, B.L., Yan\u0131ko\u011flu, I., den Hertog, D.: A practical guide to robust optimization. Omega 53, 124\u2013137 (2015)","journal-title":"Omega"},{"issue":"4","key":"174_CR21","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1287\/trsc.2014.0559","volume":"50","author":"C Gounaris","year":"2016","unstructured":"Gounaris, C., Repoussis, P., Tarantilis, C., Wiesemann, W., Floudas, C.: An adaptive memory programming framework for the robust capacitated vehicle routing problem. Transp. Sci. 50(4), 1239\u20131260 (2016)","journal-title":"Transp. Sci."},{"issue":"3","key":"174_CR22","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.1120.1136","volume":"61","author":"C Gounaris","year":"2013","unstructured":"Gounaris, C., Wiesemann, W., Floudas, C.: The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3), 677\u2013693 (2013)","journal-title":"Oper. Res."},{"key":"174_CR23","unstructured":"Guslitser, E.: Uncertainty-immunized solutions in linear programming. Master\u2019s Thesis, Technion, Israeli Institute of Technology (2002)"},{"issue":"4","key":"174_CR24","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1287\/opre.2015.1392","volume":"63","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G.A., Kuhn, D., Wiesemann, W.: $$K$$-adaptability in two-stage robust binary programming. Oper. Res. 63(4), 877\u2013891 (2015)","journal-title":"Oper. Res."},{"key":"174_CR25","unstructured":"IBM: ILOG CPLEX Optimizer (2018). \nhttps:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/\n\n. Accessed 27 July 2018"},{"key":"174_CR26","unstructured":"Jiang, R., Zhang, M., Li, G., Guan, Y.: Two-stage robust power grid optimization problem. Available on Optimization Online (2010)"},{"issue":"4","key":"174_CR27","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"174_CR28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-009-0331-4","volume":"130","author":"D Kuhn","year":"2011","unstructured":"Kuhn, D., Wiesemann, W., Georghiou, A.: Primal and dual linear decision rules in stochastic and robust optimization. Math. Program. 130(1), 177\u2013209 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"174_CR29","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A., Eglese, R.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"174_CR30","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1080\/10556780802712889","volume":"24","author":"A Mutapcic","year":"2009","unstructured":"Mutapcic, A., Boyd, S.: Cutting-set methods for robust convex optimization with pessimizing oracles. Optim. Methods Softw. 24(3), 381\u2013406 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"174_CR31","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/ijoc.2016.0696","volume":"28","author":"K Postek","year":"2016","unstructured":"Postek, K., den Hertog, D.: Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. INFORMS J. Comput. 28(3), 553\u2013574 (2016)","journal-title":"INFORMS J. Comput."},{"key":"174_CR32","unstructured":"Rubin, P.: When the OctoMom Solves MILPs (2010). \nhttps:\/\/orinanobworld.blogspot.com\/2010\/06\/when-octomom-solves-milps.html\n\n. Accessed 29 Jan 2019"},{"key":"174_CR33","doi-asserted-by":"publisher","unstructured":"Subramanyam, A., Gounaris, C., Wiesemann, W.: KAdaptabilitySolver (GitHub repository) (2019). \nhttps:\/\/doi.org\/10.5281\/zenodo.3490004","DOI":"10.5281\/zenodo.3490004"},{"key":"174_CR34","unstructured":"Thiele, A., Terry, T., Epelman, M.: Robust linear optimization with recourse. Technical Report, Lehigh University and University of Michigan, (2010)"},{"key":"174_CR35","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics, 2nd edn. (2014)","DOI":"10.1137\/1.9781611973594"},{"key":"174_CR36","doi-asserted-by":"crossref","unstructured":"Vayanos, P., Kuhn, D., Rustem, B.: Decision rules for information discovery in multi-stage stochastic programming. In: Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, pp. 7368\u20137373 (2011)","DOI":"10.1109\/CDC.2011.6161382"},{"issue":"1","key":"174_CR37","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10107-011-0478-7","volume":"135","author":"W Wiesemann","year":"2012","unstructured":"Wiesemann, W., Kuhn, D., Rustem, B.: Robust resource allocations in temporal networks. Math. Program. 135(1), 437\u2013471 (2012)","journal-title":"Math. Program."},{"issue":"3","key":"174_CR38","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"I Yan\u0131ko\u011flu","year":"2019","unstructured":"Yan\u0131ko\u011flu, I., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277(3), 799\u2013813 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"174_CR39","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5), 457\u2013561 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"174_CR40","doi-asserted-by":"crossref","first-page":"2708","DOI":"10.1109\/TPWRS.2013.2244231","volume":"28","author":"C Zhao","year":"2013","unstructured":"Zhao, C., Wang, J., Watson, J.P., Guan, Y.: Multi-stage robust unit commitment considering wind and demand response uncertainties. IEEE Trans. Power Syst. 28(3), 2708\u20132717 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"174_CR41","unstructured":"Zhao, L., Zeng, B.: An exact algorithm for two-stage robust optimization with mixed integer recourse problems. Technical Report, University of South Florida, (2012)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00174-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:40:42Z","timestamp":1604536842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00174-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00174-2","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"28 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}