{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:09Z","timestamp":1740108249662,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T00:00:00Z","timestamp":1540944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00186-018-0653-1","type":"journal-article","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T07:45:19Z","timestamp":1540971919000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Computation of weighted sums of rewards for concurrent MDPs"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9966-7686","authenticated-orcid":false,"given":"Peter","family":"Buchholz","sequence":"first","affiliation":[]},{"given":"Dimitri","family":"Scheftelowitsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"653_CR1","unstructured":"Amato C, Bernstein DS, Zilberstein S (2007) Solving POMDPs using quadratically constrained linear programs. In: Proceedings of the 20th international joint conference on artificial intelligence, IJCAI 2007. Hyderabad, India, January 6\u201312, 2007, pp 2418\u20132424"},{"key":"653_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative matrices in the mathematical sciences. Classics in applied mathematics","author":"A Berman","year":"1994","unstructured":"Berman A, Plemmons RJ (1994) Nonnegative matrices in the mathematical sciences. Classics in applied mathematics. SIAM, Philadelphia"},{"issue":"1","key":"653_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.2016.1546","volume":"65","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas D, Mi\u0161i\u0107 VV (2017) Robust product line design. Oper Res 65(1):19\u201337","journal-title":"Oper Res"},{"key":"653_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10729-016-9381-3","volume":"21","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas D, Silberholz J, Trikalinos T (2016) Optimal healthcare decision making under multiple mathematical models: application in prostate cancer screening. Health Care Manag Sci 21:105\u2013118","journal-title":"Health Care Manag Sci"},{"issue":"2","key":"653_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.dam.2006.04.029","volume":"155","author":"H Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund H, Vorobyov S (2007) A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Appl Math 155(2):210\u2013229. https:\/\/doi.org\/10.1016\/j.dam.2006.04.029","journal-title":"Discrete Appl Math"},{"key":"653_CR6","doi-asserted-by":"publisher","unstructured":"Caro F, Das-Gupta A (2015) Robust control of the multi-armed bandit problem. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-015-1965-7","DOI":"10.1007\/s10479-015-1965-7"},{"issue":"4","key":"653_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s10898-018-0612-7","volume":"71","author":"AC Castillo","year":"2018","unstructured":"Castillo AC, Castro PM, Mahalec V (2018) Global optimization of MIQCPs with dynamic piecewise relaxations. J Glob Optim 71(4):691\u2013716. https:\/\/doi.org\/10.1007\/s10898-018-0612-7","journal-title":"J Glob Optim"},{"issue":"1","key":"653_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ejor.2009.07.022","volume":"203","author":"M Colvin","year":"2010","unstructured":"Colvin M, Maravelias CT (2010) Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming. Eur J Oper Res 203(1):205\u2013215","journal-title":"Eur J Oper Res"},{"issue":"1","key":"653_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.10.1.98","volume":"10","author":"F d\u2019Epenoux","year":"1963","unstructured":"d\u2019Epenoux F (1963) A probabilistic production and inventory problem. Manag Sci 10(1):98\u2013108. https:\/\/doi.org\/10.1287\/mnsc.10.1.98","journal-title":"Manag Sci"},{"issue":"1\u20134","key":"653_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"J Dupacov\u00e1","year":"2000","unstructured":"Dupacov\u00e1 J, Consigli G, Wallace SW (2000) Scenarios for multistage stochastic programs. Ann Oper Res 100(1\u20134):25\u201353. https:\/\/doi.org\/10.1023\/A:1019206915174","journal-title":"Ann Oper Res"},{"key":"653_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin. https:\/\/doi.org\/10.1007\/3-540-27659-9","edition":"2"},{"volume-title":"Handbook of Markov decision processes","year":"2002","key":"653_CR12","unstructured":"Feinberg EA, Schwartz A (eds) (2002) Handbook of Markov decision processes. Kluwer, Boston"},{"key":"653_CR13","volume-title":"Competitive Markov decision processes","author":"J Filar","year":"1997","unstructured":"Filar J, Vrieze K (1997) Competitive Markov decision processes. Springer, New York"},{"issue":"11","key":"653_CR14","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/j.peva.2010.08.009","volume":"67","author":"A Gandhi","year":"2010","unstructured":"Gandhi A, Gupta V, Harchol-Balter M, Kozuch MA (2010) Optimality analysis of energy-performance trade-off for server farm management. Perform Eval 67(11):1155\u20131171","journal-title":"Perform Eval"},{"key":"653_CR15","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"1\u20132","key":"653_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0004-3702(00)00047-3","volume":"122","author":"R Givan","year":"2000","unstructured":"Givan R, Leach SM, Dean TL (2000) Bounded-parameter Markov decision processes. Artif Intell 122(1\u20132):71\u2013109","journal-title":"Artif Intell"},{"issue":"2","key":"653_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/1031049","volume":"31","author":"WW Hager","year":"1989","unstructured":"Hager WW (1989) Updating the inverse of a matrix. SIAM Rev 31(2):221\u2013239","journal-title":"SIAM Rev"},{"issue":"2","key":"653_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.1040.0129","volume":"30","author":"GN Iyengar","year":"2005","unstructured":"Iyengar GN (2005) Robust dynamic programming. Math Oper Res 30(2):257\u2013280","journal-title":"Math Oper Res"},{"issue":"1\u20132","key":"653_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"LP Kaelbling","year":"1998","unstructured":"Kaelbling LP, Littman ML, Cassandra AR (1998) Planning and acting in partially observable stochastic domains. Artif Intell 101(1\u20132):99\u2013134","journal-title":"Artif Intell"},{"issue":"5","key":"653_CR20","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1080\/02331934.2013.769104","volume":"62","author":"K Klamroth","year":"2013","unstructured":"Klamroth K, K\u00f6bis E, Sch\u00f6bel A, Tammer C (2013) A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals. Optimization 62(5):649\u2013671","journal-title":"Optimization"},{"key":"653_CR21","doi-asserted-by":"crossref","unstructured":"Mercier L, Hentenryck PV (2008) Amsaa: a multistep anticipatory algorithm for online stochastic combinatorial optimization. In: Perron L, Trick MA (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 5th international conference, CPAIOR 2008, Paris, France, May 20\u201323, 2008, Proceedings. Lecture Notes in Computer Science, vol 5015, pp 173\u2013187. Springer","DOI":"10.1007\/978-3-540-68155-7_15"},{"key":"653_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial algorithms in convex programming. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"5","key":"653_CR23","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1287\/opre.1050.0216","volume":"53","author":"A Nilim","year":"2005","unstructured":"Nilim A, Ghaoui LE (2005) Robust control of Markov decision processes with uncertain transition matrices. Oper Res 53(5):780\u2013798","journal-title":"Oper Res"},{"issue":"3","key":"653_CR24","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"CH Papadimitriou","year":"1987","unstructured":"Papadimitriou CH, Tsitsiklis JN (1987) The complexity of Markov decision processes. Math Oper Res 12(3):441\u2013450","journal-title":"Math Oper Res"},{"key":"653_CR25","unstructured":"Park J, Boyd S (2017) Heuristics for nonconvex quadratically constrained quadratic programming. CoRR arXiv:1703.07870v2"},{"key":"653_CR26","volume-title":"Markov decision processes","author":"ML Puterman","year":"2005","unstructured":"Puterman ML (2005) Markov decision processes. Wiley, London"},{"key":"653_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1927-3_14","volume-title":"Mixed integer nonlinear programming","author":"A Qualizza","year":"2012","unstructured":"Qualizza A, Belotti P, Margot F (2012) Linear programming relaxations of quadratically constrained quadratic programs. In: Lee J, Leyffer S (eds) Mixed integer nonlinear programming, vol 154. Springer, New York"},{"key":"653_CR28","unstructured":"Raskin J, Sankur O (2014) Multiple-environment Markov decision processes. CoRR arXiv:1405.4733"},{"issue":"1","key":"653_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar RT, Wets RJ (1991) Scenarios and policy aggregation in optimization under uncertainty. Math Oper Res 16(1):119\u2013147","journal-title":"Math Oper Res"},{"key":"653_CR30","doi-asserted-by":"crossref","unstructured":"Roijers DM, Scharpff J, Spaan MTJ, Oliehoek FA, de\u00a0Weerdt M, Whiteson S (2014) Bounded approximations for linear multi-objective planning under uncertainty. In: Chien SA, Do MB, Fern A, Ruml W (eds) Proceedings of the twenty-fourth international conference on automated planning and scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21\u201326, 2014. http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS14\/paper\/view\/7929","DOI":"10.1609\/icaps.v24i1.13641"},{"key":"653_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on stochastic programming","author":"A Ruszczy\u0144ski","year":"2009","unstructured":"Ruszczy\u0144ski A, Shapiro A (2009) Lectures on stochastic programming. SIAM, Philadelphia. https:\/\/doi.org\/10.1137\/1.9780898718751"},{"issue":"3","key":"653_CR32","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1287\/opre.21.3.728","volume":"21","author":"JK Satia","year":"1973","unstructured":"Satia JK, Lave RE (1973) Markovian decision processes with uncertain transition probabilities. Oper Res 21(3):728\u2013740","journal-title":"Oper Res"},{"issue":"3","key":"653_CR33","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.27.3.616","volume":"27","author":"RF Serfozo","year":"1979","unstructured":"Serfozo RF (1979) An equivalence between continuous and discrete time Markov decision processes. Oper Res 27(3):616\u2013620","journal-title":"Oper Res"},{"volume-title":"Markov decision processes in artificial intelligence","year":"2010","key":"653_CR34","unstructured":"Sigaud O, Buffet O (eds) (2010) Markov decision processes in artificial intelligence. Wiley-ISTE, London"},{"key":"653_CR35","unstructured":"Singh SP, Cohn D (1997) How to dynamically merge Markov decision processes. In: Jordan MI, Kearns MJ, Solla SA(eds) Advances in neural information processing systems 10, [NIPS Conference, Denver, Colorado, USA, 1997]. The MIT Press, pp 1057\u20131063"},{"key":"653_CR36","doi-asserted-by":"crossref","unstructured":"Singh SP, Jaakkola TS, Jordan MI (1994) Learning without state-estimation in partially observable Markovian decision processes. In: Cohen WW, Hirsh H (eds) Machine learning, proceedings of the eleventh international conference, Rutgers University, New Brunswick, NJ, USA, July 10\u201313, 1994, pp 284\u2013292","DOI":"10.1016\/B978-1-55860-335-6.50042-8"},{"key":"653_CR37","unstructured":"Steimle LN, Kaufman DL, Denton BT (2018) Multi-model Markov decision processes. Technical report, Optimization-online"},{"issue":"1","key":"653_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev 57(1):3\u201357","journal-title":"SIAM Rev"},{"key":"653_CR39","unstructured":"Walraven E, Spaan MTJ (2015) Planning under uncertainty with weighted state scenarios. In: Meila M, Heskes T (eds) Proceedings of the thirty-first conference on uncertainty in artificial intelligence, UAI 2015, July 12\u201316, 2015, Amsterdam, The Netherlands, pp 912\u2013921. AUAI Press"},{"issue":"4","key":"653_CR40","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1287\/opre.42.4.739","volume":"42","author":"CC White","year":"1994","unstructured":"White CC, Eldeib HK (1994) Markov decision processes with imprecise transition probabilities. Oper Res 42(4):739\u2013749","journal-title":"Oper Res"},{"issue":"6","key":"653_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(89)90348-2","volume":"39","author":"CC White","year":"1989","unstructured":"White CC, White DJ (1989) Markov decision processes. Eur J Oper Res 39(6):1\u201316","journal-title":"Eur J Oper Res"},{"issue":"12","key":"653_CR42","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.peva.2012.07.002","volume":"69","author":"A Wierman","year":"2012","unstructured":"Wierman A, Andrew LL, Tang A (2012) Power-aware speed scaling in processor sharing systems: optimality and robustness. Perform Eval 69(12):601\u2013622","journal-title":"Perform Eval"},{"issue":"1","key":"653_CR43","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1287\/moor.1120.0566","volume":"38","author":"W Wiesemann","year":"2013","unstructured":"Wiesemann W, Kuhn D, Rustem B (2013) Robust Markov decision processes. Math Oper Res 38(1):153\u2013183","journal-title":"Math Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-018-0653-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0653-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0653-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T16:05:59Z","timestamp":1694016359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-018-0653-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,31]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["653"],"URL":"https:\/\/doi.org\/10.1007\/s00186-018-0653-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2018,10,31]]},"assertion":[{"value":"21 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}