{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T02:10:23Z","timestamp":1770689423463,"version":"3.49.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada (CA)"},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10898-017-0581-2","type":"journal-article","created":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T02:09:04Z","timestamp":1509329344000},"page":"811-842","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Utility Theory Based Interactive Approach to Robustness in Linear Optimization"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0153-0612","authenticated-orcid":false,"given":"Mehdi","family":"Karimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somayeh","family":"Moazeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"issue":"1","key":"581_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2181\/036.041.0101","volume":"41","author":"J Anderson","year":"2009","unstructured":"Anderson, J., Jibrin, S.: An interior point method for linear programming using weighted analytic centers. J. Ariz. Nev. Acad. Sci. 41(1), 1\u20137 (2009)","journal-title":"J. Ariz. Nev. Acad. Sci."},{"key":"581_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/moor.22.1.63","volume":"22","author":"KM Anstreicher","year":"1997","unstructured":"Anstreicher, K.M.: On Vaidya\u2019s volumetric cutting plane method for convex programming. Math. Oper. Res. 22, 63\u201389 (1997)","journal-title":"Math. Oper. Res."},{"key":"581_CR3","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0377-2217(96)90078-8","volume":"89","author":"A Ardel","year":"1996","unstructured":"Ardel, A., Oren, S.: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm. Eur. J. Oper. Res. 89, 202\u2013211 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1-3","key":"581_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01585551","volume":"69","author":"DS Atkinson","year":"1995","unstructured":"Atkinson, D.S., Vaidya, P.M.: A cutting plane algorithm for convex programming that uses analytic centers. Math. Program. 69(1-3), 1\u201343 (1995)","journal-title":"Math. Program."},{"key":"581_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10107-005-0679-z","volume":"107","author":"A Ben-Tal","year":"2006","unstructured":"Ben-Tal, A., Boyd, S., Nemirovski, A.: Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems. Math. Program. 107, 63\u201389 (2006)","journal-title":"Math. Program."},{"key":"581_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robustness Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robustness Optimization. Princeton University Press, Princeton (2009)"},{"key":"581_CR7","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, 351\u2013376 (2004)","journal-title":"Math. Program."},{"key":"581_CR8","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88, 411\u2013424 (2000)","journal-title":"Math. Program."},{"key":"581_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"key":"581_CR10","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"581_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10898-009-9496-x","volume":"48","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Nohadani, O.: Robust optimization with simulated annealing. J. Global Optim. 48(2), 323\u2013334 (2010)","journal-title":"J. Global Optim."},{"key":"581_CR12","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32, 510\u2013516 (2004)","journal-title":"Oper. Res. Lett."},{"key":"581_CR13","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1137\/S1052623401399903","volume":"15","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Popescu, I.: Optimal inequalities in probability theory\u2014a convex optimization approach. SIAM J. Optim. 15, 780\u2013804 (2005)","journal-title":"SIAM J. Optim."},{"key":"581_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-005-0677-1","volume":"107","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., Sim, M.: Tractable approximations to robust conic optimization problems. Math. Program. 107, 5\u201336 (2006)","journal-title":"Math. Program."},{"key":"581_CR15","doi-asserted-by":"crossref","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, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"581_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49\u201371 (2003)","journal-title":"Math. Program."},{"key":"581_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"},{"key":"581_CR18","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1287\/opre.1070.0484","volume":"56","author":"T Bortfeld","year":"2008","unstructured":"Bortfeld, T., Chan, T.C.Y., Trofimov, A., Tsitsiklis, J.N.: Robust management of motion uncertainty in intensity-modulated radiation therapy. Oper. Res. 56, 1461\u20131473 (2008)","journal-title":"Oper. Res."},{"key":"581_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vanderberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"581_CR20","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/j.ejor.2013.06.003","volume":"231","author":"TC Chan","year":"2013","unstructured":"Chan, T.C., Mi\u0161i\u0107, V.V.: Adaptive and robust radiation therapy optimization for lung cancer. Eur. J. Oper. Res. 231, 745\u2013756 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"581_CR21","doi-asserted-by":"crossref","first-page":"5463","DOI":"10.1088\/0031-9155\/50\/23\/003","volume":"50","author":"M Chu","year":"2006","unstructured":"Chu, M., Zinchenko, Y., Henderson, S.G., Sharpe, M.B.: Robust optimization for intensity modulated radiation therapy treatment planning under uncertainty. Phys. Med. Biol. 50, 5463\u20135477 (2006)","journal-title":"Phys. Med. Biol."},{"issue":"2","key":"581_CR22","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10898-014-0187-x","volume":"60","author":"AA Coco","year":"2014","unstructured":"Coco, A.A., J\u00fanior, J.C.A., Noronha, T.F., Santos, A.C.: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Global Optim. 60(2), 265\u2013287 (2014)","journal-title":"J. Global Optim."},{"key":"581_CR23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L Ghaoui El","year":"1998","unstructured":"El Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9, 33\u201352 (1998)","journal-title":"SIAM J. Optim."},{"key":"581_CR24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-005-0678-0","volume":"107","author":"E Erdo\u011fan","year":"2006","unstructured":"Erdo\u011fan, E., Iyengar, G.: Ambiguous chance constrained problems and robust optimization. Math. Program. 107, 37\u201390 (2006)","journal-title":"Math. Program."},{"key":"581_CR25","doi-asserted-by":"crossref","unstructured":"Goffin, J.L., Luo, Z.Q., Ye, Y. : On the complexity of a column generation algorithm for convex and quasiconvex feasibility problems. In: Large Scale Optimization: State of the Art, pp. 187\u2013196. Kluwer, Dordrecht (1993)","DOI":"10.1007\/978-1-4613-3632-7_10"},{"key":"581_CR26","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"JL Goffin","year":"2002","unstructured":"Goffin, J.L., Vial, J.P.: Convex non-differentiable optimization: a survey focused on the analytic center cutting-plane method. Optim. Methods Softw. 17, 805\u2013867 (2002)","journal-title":"Optim. Methods Softw."},{"key":"581_CR27","doi-asserted-by":"crossref","unstructured":"Goh, J., Sim, M.: Distributionally robust optimization and its tractable approximations. Oper. Res. 58(4-part-1), 902\u2013917 (2010)","DOI":"10.1287\/opre.1090.0795"},{"issue":"2","key":"581_CR28","doi-asserted-by":"crossref","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":"581_CR29","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.2140\/pjm.1960.10.1257","volume":"10","author":"B Gr\u00fcnbaum","year":"1960","unstructured":"Gr\u00fcnbaum, B.: Partitions of mass-distributions and convex bodies by hyperplanes. Pac. J. Math. 10, 1257\u20131261 (1960)","journal-title":"Pac. J. Math."},{"issue":"1","key":"581_CR30","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10107-015-0896-z","volume":"151","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G.A., Roitch, V., Kuhn, D., Wiesemann, W.: A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Program. 151(1), 35\u201362 (2015)","journal-title":"Math. Program."},{"key":"581_CR31","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1287\/opre.1120.1071","volume":"60","author":"J Hu","year":"2012","unstructured":"Hu, J., Mehrotra, S.: Robust and stochastically weighted multiobjective optimization models and reformulations. Oper. Res. 60, 936\u2013953 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"581_CR32","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/mnsc.2013.1753","volume":"60","author":"DA Iancu","year":"2013","unstructured":"Iancu, D.A., Trichakis, N.: Pareto efficiency in robust optimization. Manag. Sci. 60(1), 130\u2013147 (2013)","journal-title":"Manag. Sci."},{"key":"581_CR33","volume-title":"Goal Programming and Extensions","author":"JP Ignizio","year":"1976","unstructured":"Ignizio, J.P.: Goal Programming and Extensions. Lexington Books, Lexington (1976)"},{"key":"581_CR34","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S., Lee, J., Campbell, M.: Q-Eval: Evaluating multiple attribute items using queries. In: Proceedings of the 3rd ACM Conference on Electronic Commerce, pp. 144\u2013153 (2001)","DOI":"10.1145\/501158.501174"},{"key":"581_CR35","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: a survey. J. Artif. Intell. Res. 4, 237\u2013285 (1996)","journal-title":"J. Artif. Intell. Res."},{"key":"581_CR36","unstructured":"Karimi, M.: A quick-and-dirty approach to robustness in linear optimization, Master\u2019s Thesis, University of Waterloo, (2012)"},{"key":"581_CR37","unstructured":"Karimi, M., Moazeni, S., Tun\u00e7el, L.: A utility theory based interactive approach to robustness in linear optimization. arXiv:1312.4489"},{"key":"581_CR38","volume-title":"Value-Focused Thinking","author":"R Keeney","year":"1992","unstructured":"Keeney, R.: Value-Focused Thinking. Harvard University Press, London (1992)"},{"key":"581_CR39","volume-title":"Decision with Multiple Objectives","author":"R Keeney","year":"1976","unstructured":"Keeney, R., Raiffa, H.: Decision with Multiple Objectives. Wiley, New York (1976)"},{"issue":"1","key":"581_CR40","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan, L.G.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53\u201372 (1980)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"581_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, vol. 538. Springer, New York (1991)"},{"key":"581_CR42","doi-asserted-by":"crossref","DOI":"10.1142\/8042","volume-title":"Multiple Criteria Decision Making: From Early History to the 21st Century","author":"M K\u00f6ksalan","year":"2011","unstructured":"K\u00f6ksalan, M., Wallenius, J., Zionts, S.: Multiple Criteria Decision Making: From Early History to the 21st Century. World Scientific, Singapore (2011)"},{"issue":"1","key":"581_CR43","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10898-014-0222-y","volume":"62","author":"D Lu","year":"2015","unstructured":"Lu, D., Gzara, F.: The robust crew pairing problem: model and solution methodology. J. Global Optim. 62(1), 29\u201354 (2015)","journal-title":"J. Global Optim."},{"key":"581_CR44","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1287\/opre.13.6.930","volume":"13","author":"LB Miller","year":"1965","unstructured":"Miller, L.B., Wagner, H.: Chance-constrained programming with joint constraints. Oper. Res. 13, 930\u2013945 (1965)","journal-title":"Oper. Res."},{"issue":"3","key":"581_CR45","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10898-010-9645-2","volume":"49","author":"M Minoux","year":"2011","unstructured":"Minoux, M.: On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Global Optim. 49(3), 521\u2013537 (2011)","journal-title":"J. Global Optim."},{"key":"581_CR46","unstructured":"Moazeni, S.: Flexible robustness in linear optimization. Master\u2019s Thesis, University of Waterloo (2006)"},{"issue":"3","key":"581_CR47","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.25.3.381.12216","volume":"25","author":"RDC Monteiro","year":"2000","unstructured":"Monteiro, R.D.C., Zanj\u00e1como, P.R.: General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems. Math. Oper. Res. 25(3), 381\u2013399 (2000)","journal-title":"Math. Oper. Res."},{"key":"581_CR48","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511840609","volume-title":"Uncertainty\u2014A Guide to Dealing with Uncertainty in Quantitative Risk and Policy Analysis","author":"MG Morgan","year":"1990","unstructured":"Morgan, M.G., Henrion, M.: Uncertainty\u2014A Guide to Dealing with Uncertainty in Quantitative Risk and Policy Analysis. Cambridge University Press, New York (1990)"},{"key":"581_CR49","unstructured":"Mudchanatongsuk, S., Ordonez, F., Liu, J.: Robust Solutions for Network Design Under Transportation Cost And Demand Uncertainty. USC ISE working paper (2005-05)"},{"key":"581_CR50","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Oper. Res. 43, 264\u2013281 (1995)","journal-title":"Oper. Res."},{"key":"581_CR51","first-page":"969","volume":"4","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 4, 969\u2013996 (2006)","journal-title":"SIAM J. Optim."},{"key":"581_CR52","first-page":"149","volume":"69","author":"Yu Nesterov","year":"1995","unstructured":"Nesterov, Yu.: Complexity estimates of some cutting-plane methods based on the analytic barrier. Math. Program. Ser. B 69, 149\u2013176 (1995)","journal-title":"Math. Program. Ser. B"},{"key":"581_CR53","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Algorithms in Convex Programming","author":"Yu Nesterov","year":"1994","unstructured":"Nesterov, Yu., Nemirovskii, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"581_CR54","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/321281.321291","volume":"12","author":"DJ Newman","year":"1965","unstructured":"Newman, D.J.: Location of the maximum on unimodal surfaces. JACM 12, 395\u2013398 (1965)","journal-title":"JACM"},{"key":"581_CR55","unstructured":"Ordonez, F., Zhao, J.: Robust Capacity Expansion Of Network Flows. USC-ISE working paper (2004-01)"},{"issue":"2-3","key":"581_CR56","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10898-007-9244-z","volume":"43","author":"P Parpas","year":"2009","unstructured":"Parpas, P., Rustem, B., Pistikopoulos, E.N.: Global optimization of robust chance constrained problems. J. Global Optim. 43(2-3), 231\u2013247 (2009)","journal-title":"J. Global Optim."},{"key":"581_CR57","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)"},{"key":"581_CR58","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167, 96\u2013115 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"581_CR59","unstructured":"Shapiro, A.: Distributionally robust stochastic programming. Optim. Online (2016). http:\/\/www.optimization-online.org\/DB_HTML\/2015\/12\/5238.html"},{"issue":"1","key":"581_CR60","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10898-006-9035-y","volume":"37","author":"HD Sherali","year":"2007","unstructured":"Sherali, H.D., Ganesan, V.: An inverse reliability-based approach for designing under uncertainty with application to robust piston design. J. Global Optim. 37(1), 47\u201362 (2007)","journal-title":"J. Global Optim."},{"key":"581_CR61","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10479-010-0779-x","volume":"196","author":"MY Sir","year":"2012","unstructured":"Sir, M.Y., Epelman, M.A., Pollock, S.M.: Stochastic programming for off-line adaptive radiotherapy. Ann. Oper. Res. 196, 767\u2013797 (2012)","journal-title":"Ann. Oper. Res."},{"key":"581_CR62","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"key":"581_CR63","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning: an introduction. MIT Press, Cambridge (1998)"},{"key":"581_CR64","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. In: Symposium on Foundations of Computer Science, pp. 338\u2013343 (1989)","DOI":"10.1109\/SFCS.1989.63500"},{"key":"581_CR65","first-page":"462","volume-title":"A Technique for Bounding the Number of Iterations in Path Following Algorithms, Complexity in Numerical Optimization","author":"PM Vaidya","year":"1993","unstructured":"Vaidya, P.M., Atkinson, D.S.: A Technique for Bounding the Number of Iterations in Path Following Algorithms, Complexity in Numerical Optimization, pp. 462\u2013489. World Scientific, Singapore (1993)"},{"key":"581_CR66","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10898-014-0251-6","volume":"64","author":"F Wang","year":"2016","unstructured":"Wang, F., Xu, D., Wu, C.: Combinatorial approximation algorithms for the robust facility location problem with penalties. J. Global Optim. 64, 483\u2013496 (2016)","journal-title":"J. Global Optim."},{"key":"581_CR67","first-page":"25","volume":"13","author":"DB Yudin","year":"1977","unstructured":"Yudin, D.B., Nemirovski, A.S.: Informational complexity and efficient methods for solving complex extremal problems. Matekon 13, 25\u201345 (1977)","journal-title":"Matekon"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0581-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0581-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0581-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T05:24:34Z","timestamp":1570253074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0581-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["581"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0581-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,30]]}}}