{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T09:53:07Z","timestamp":1744278787151,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319675039"},{"type":"electronic","value":"9783319675046"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67504-6_7","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T02:03:20Z","timestamp":1506132200000},"page":"93-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Anytime Algorithms for Adaptive Robust Optimization with OWA and WOWA"],"prefix":"10.1007","author":[{"given":"Nadjet","family":"Bourdache","sequence":"first","affiliation":[]},{"given":"Patrice","family":"Perny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"issue":"6","key":"7_CR1","first-page":"634","volume":"33","author":"H Aissi","year":"2005","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the minmax and minmax regret assignment problems. OR Lett. 33(6), 634\u2013640 (2005)","journal-title":"OR Lett."},{"issue":"1","key":"7_CR2","first-page":"36","volume":"32","author":"ID Aron","year":"2004","unstructured":"Aron, I.D., Van Hentenryck, P.: On the complexity of the robust spanning tree problem with interval data. OR Lett. 32(1), 36\u201340 (2004)","journal-title":"OR Lett."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Perny, P.: Incremental weight elicitation for multiobjective state space search. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1093\u20131099 (2015)","DOI":"10.1609\/aaai.v29i1.9362"},{"issue":"8\u20139","key":"7_CR4","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.artint.2006.02.003","volume":"170","author":"C Boutilier","year":"2006","unstructured":"Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8\u20139), 686\u2013713 (2006)","journal-title":"Artif. Intell."},{"issue":"2","key":"7_CR5","first-page":"175","volume":"34","author":"VG De\u0131","year":"2006","unstructured":"De\u0131, V.G., Woeginger, G.J.: On the robust assignment problem under a fixed number of cost scenarios. OR Lett. 34(2), 175\u2013179 (2006)","journal-title":"OR Lett."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1016\/j.cor.2011.09.003","volume":"39","author":"L Galand","year":"2012","unstructured":"Galand, L., Spanjaard, O.: Exact algorithms for OWA-optimization in multiobjective spanning tree problems. Comput. Oper. Res. 39(7), 1540\u20131554 (2012)","journal-title":"Comput. Oper. Res."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-23114-3_31","volume-title":"Algorithmic Decision Theory","author":"T Heinen","year":"2015","unstructured":"Heinen, T., Nguyen, N.-T., Rothe, J.: Fairness and rank-weighted utilitarianism in resource allocation. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 521\u2013536. Springer, Cham (2015). doi:10.1007\/978-3-319-23114-3_31"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/0022-0531(87)90093-7","volume":"42","author":"CS Hong","year":"1987","unstructured":"Hong, C.S., Karni, E., Safra, Z.: Risk aversion in the theory of expected utility with rank dependent probabilities. J. Econ. Theory 42(2), 370\u2013381 (1987)","journal-title":"J. Econ. Theory"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-44867-5_14","volume-title":"Experimental and Efficient Algorithms","author":"VM Jim\u00e9nez","year":"2003","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: A lazy version of Eppstein\u2019s K shortest paths algorithm. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 179\u2013191. Springer, Heidelberg (2003). doi:10.1007\/3-540-44867-5_14"},{"key":"7_CR11","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"2013","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications, vol. 14. Springer Science & Business Media, New York (2013)"},{"key":"7_CR12","unstructured":"Lesca, J., Perny, P.: LP solvable models for multiagent fair allocation problems. In: Proceedings of the 2010 Conference on ECAI 2010: 19th European Conference on Artificial Intelligence, pp. 393\u2013398. IOS Press (2010)"},{"key":"7_CR13","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"AW Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of Majorization and Its Applications, vol. 143. Springer, New York (1979)"},{"issue":"10","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R Montemanni","year":"2004","unstructured":"Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31(10), 1667\u20131680 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/1520-6750(199208)39:5<669::AID-NAV3220390506>3.0.CO;2-W","volume":"39","author":"I Murthy","year":"1992","unstructured":"Murthy, I., Her, S.-S.: Solving min-max shortest-path problems on a network. Nav. Res. Logist. (NRL) 39(5), 669\u2013683 (1992)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"KG Murthy","year":"1968","unstructured":"Murthy, K.G.: An algorithm for ranking all the assignments in order of increasing costs. Oper. Res. 16(3), 682\u2013687 (1968)","journal-title":"Oper. Res."},{"issue":"2","key":"7_CR17","first-page":"303","volume":"36","author":"W Ogryczak","year":"2007","unstructured":"Ogryczak, W.: Multicriteria models for fair resource allocation. Control Cybern. 36(2), 303\u2013332 (2007)","journal-title":"Control Cybern."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10479-006-0073-0","volume":"147","author":"P Perny","year":"2006","unstructured":"Perny, P., Spanjaard, O., Storme, L.-X.: A decision-theoretic approach to robust optimization in multivalued graphs. Ann. Oper. Res. 147(1), 317\u2013341 (2006)","journal-title":"Ann. Oper. Res."},{"key":"7_CR19","unstructured":"Perny, P., Viappiani, P., Boukhatem, A.: Incremental preference elicitation for decision making under risk with the rank-dependent utility model. In: Proceedings of UAI 2016 (2016)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1214\/ss\/1177012761","volume":"3","author":"JO Ramsay","year":"1988","unstructured":"Ramsay, J.O.: Monotone regression spline in action. Stat. Sci. 3, 425\u2013441 (1988)","journal-title":"Stat. Sci."},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0022-0531(70)90038-4","volume":"2","author":"JE Stiglitz","year":"1970","unstructured":"Stiglitz, J.E., Rothschild, M.: Increasing risk. I. A definition. J. Econ. Theory 2(3), 225\u2013243 (1970)","journal-title":"J. Econ. Theory"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/(SICI)1098-111X(199702)12:2<153::AID-INT3>3.0.CO;2-P","volume":"12","author":"V Torra","year":"1997","unstructured":"Torra, V.: The weighted OWA operator. Int. J. Intell. Syst. 12, 153\u2013166 (1997)","journal-title":"Int. J. Intell. Syst."},{"key":"7_CR23","unstructured":"Wang, T., Boutilier, C.: Incremental utility elicitation with the minimax regret decision criterion. In: Proceedings of IJCAI, pp. 309\u2013318 (2003)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Wu, W., Iori, M., Martello, S., Yagiura, M.: Algorithms for the min-max regret generalized assignment problem with interval data. In: Proceedings of IEEM, pp. 734\u2013738. IEEE (2014)","DOI":"10.1109\/IEEM.2014.7058735"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2307\/1911158","volume":"55","author":"ME Yaari","year":"1987","unstructured":"Yaari, M.E.: The dual theory of choice under risk. Econometrica 55, 95\u2013115 (1987)","journal-title":"Econometrica"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"RR Yager","year":"1998","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man Cybern. 18, 183\u2013190 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"7_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"H Yaman","year":"2001","unstructured":"Yaman, H., Kara\u015fan, O.E., P\u0131nar, M.\u00c7.: The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1), 31\u201340 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1022601301102","volume":"98","author":"Y Gang","year":"1998","unstructured":"Gang, Y.: Min-max optimization of several classical discrete optimization problems. J. Optim. Theory Appl. 98(1), 221\u2013242 (1998)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"7_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"Y Gang","year":"1998","unstructured":"Gang, Y., 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","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67504-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T07:43:19Z","timestamp":1659512599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67504-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319675039","9783319675046"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67504-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sma.uni.lu\/adt2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}