{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T10:20:36Z","timestamp":1770891636257,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662489703","type":"print"},{"value":"9783662489710","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_42","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"491-501","source":"Crossref","is-referenced-by-count":8,"title":["Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Mastin","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Jaillet","sequence":"additional","affiliation":[]},{"given":"Sang","family":"Chin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"6","key":"42_CR1","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","volume":"33","author":"H Aissi","year":"2005","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6), 634\u2013640 (2005)","journal-title":"Oper. Res. Lett."},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/11602613_79","volume-title":"Algorithms and Computation","author":"H Aissi","year":"2005","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max (regret) versions of cut problems. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 789\u2013798. Springer, Heidelberg (2005)"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11809678_45","volume-title":"Computing and Combinatorics","author":"H Aissi","year":"2006","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Approximating min-max (regret) versions of some polynomial problems. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 428\u2013438. Springer, Heidelberg (2006)"},{"issue":"2","key":"42_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ejor.2006.03.023","volume":"179","author":"H Aissi","year":"2007","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Approximation of min-max and min-max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179(2), 281\u2013290 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427\u2013438 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"42_CR6","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.disopt.2010.03.004","volume":"7","author":"H Aissi","year":"2010","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: General approximation schemes for min-max (regret) versions of some (pseudo-) polynomial problems. Discrete Optim. 7(3), 136\u2013148 (2010)","journal-title":"Discrete Optim."},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I Averbakh","year":"2001","unstructured":"Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. 90(2), 263\u2013272 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I Averbakh","year":"2004","unstructured":"Averbakh, I., Lebedev, V.: Interval data minmax regret network optimization problems. Discrete Appl. Math. 138(3), 289\u2013301 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"42_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ejor.2003.07.007","volume":"160","author":"I Averbakh","year":"2005","unstructured":"Averbakh, I., Lebedev, V.: On the complexity of minmax regret linear programming. Eur. J. Oper. Res. 160(1), 227\u2013231 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR10","unstructured":"Bertsimas, D., Nasrabadi, E., Orlin, J.B.: On the power of nature in robust discrete optimization (2013, working papers)"},{"key":"42_CR11","unstructured":"Bertsimas, D., Nasrabadi, E., Orlin, J.B.: On the power of randomization in network interdiction. arXiv preprint (2013). http:\/\/arxiv.org\/abs\/1312.3478"},{"issue":"1","key":"42_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"42_CR13","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Kalai, A.T., Lucier, B., Moitra, A., Postlewaite, A., Tennenholtz, M.: Dueling algorithms. In: Proceedings of the Forty-Third annual ACM Symposium on Theory of Computing, pp. 215\u2013224. ACM (2011)","DOI":"10.1145\/1993636.1993666"},{"key":"42_CR16","unstructured":"Johannes, B., Orlin, J.B.: Minimax regret problems are harder than minimax problems (2012, working papers)"},{"key":"42_CR17","series-title":"Studies in Fuzziness and Soft Computing","volume-title":"Discrete Optimization with Interval Data: Minmax Regret and Fuzzy Approach","author":"A Kasperski","year":"2008","unstructured":"Kasperski, A.: Discrete Optimization with Interval Data. STUDFUZZ, vol. 228. Springer, Heidelberg (2008)"},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2012.10.001","volume":"113","author":"A Kasperski","year":"2013","unstructured":"Kasperski, A., Kurpisz, A., Zieli\u0144ski, P.: Approximating the min-max (regret) selecting items problem. Inf. Process. Lett. 113(1), 23\u201329 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"42_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A Kasperski","year":"2006","unstructured":"Kasperski, A., Zieli\u0144ski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5), 177\u2013180 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"42_CR20","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.orl.2006.09.007","volume":"35","author":"A Kasperski","year":"2007","unstructured":"Kasperski, A., Zieli\u0144ski, P.: On the existence of an fptas for minmax regret combinatorial optimization problems with interval data. Oper. Res. Lett. 35(4), 525\u2013532 (2007)","journal-title":"Oper. Res. Lett."},{"key":"42_CR21","unstructured":"Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ord\u00f3\u00f1ez, F., Tambe, M.: Computing optimal randomized resource allocations for massive security games. In: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 689\u2013696. International Foundation for Autonomous Agents and Multiagent Systems (2009)"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal stackelberg strategies in security resource allocation games. In: Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7638"},{"key":"42_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Springer, New York (1997)"},{"key":"42_CR24","unstructured":"Mastin, A., Jaillet, P., Chin, S.: Randomized minmax regret for combinatorial optimization under uncertainty. arXiv preprint (2014). http:\/\/arxiv.org\/abs\/1401.7043"},{"issue":"253","key":"42_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/01621459.1951.10500768","volume":"46","author":"LJ Savage","year":"1951","unstructured":"Savage, L.J.: The theory of statistical decision. J. Am. Stat. Assoc. 46(253), 55\u201367 (1951)","journal-title":"J. Am. Stat. Assoc."},{"key":"42_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.P.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"issue":"4","key":"42_CR27","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1214\/aoms\/1177732144","volume":"10","author":"A Wald","year":"1939","unstructured":"Wald, A.: Contributions to the theory of statistical estimation and testing hypotheses. Ann. Math. Stat. 10(4), 299\u2013326 (1939)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"42_CR28","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"G Yu","year":"1998","unstructured":"Yu, G., Yang, J.: On the robust shortest path problem. Comput. Oper. Res. 25(6), 457\u2013468 (1998)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T23:55:31Z","timestamp":1692143731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}