{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:06:34Z","timestamp":1761894394002},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,9,14]],"date-time":"2006-09-14T00:00:00Z","timestamp":1158192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10479-006-0073-0","type":"journal-article","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T16:43:53Z","timestamp":1158165833000},"page":"317-341","source":"Crossref","is-referenced-by-count":33,"title":["A decision-theoretic approach to robust optimization in multivalued graphs"],"prefix":"10.1007","volume":"147","author":[{"given":"Patrice","family":"Perny","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Spanjaard","sequence":"additional","affiliation":[]},{"given":"Louis-Xavier","family":"Storme","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,14]]},"reference":[{"issue":"3","key":"73_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/opre.2.3.275","volume":"2","author":"R. Bellman","year":"1954","unstructured":"Bellman, R. (1954). \u201cSome Applications of the Theory of Dynamic Programming\u2014A Review.\u201d Journal of the Operational Research Society of America, 2(3), 275\u2013288.","journal-title":"Journal of the Operational Research Society of America"},{"key":"73_CR2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(89)90384-6","volume":"41","author":"P. Brucker","year":"1989","unstructured":"Brucker, P. and H. Hamacher. (1989). \u201ck-Optimal Solution sets for Some Polynomially Solvable Scheduling Problems.\u201d European Journal of Operational Research, 41, 194\u2013202.","journal-title":"European Journal of Operational Research"},{"key":"73_CR3","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A. (1889). \u201cA Theorem on Trees.\u201d Quaterly Journal of Mathematics, 23, 376\u2013378.","journal-title":"Quaterly Journal of Mathematics"},{"key":"73_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(87)90017-5","volume":"18","author":"C. Chegireddy","year":"1987","unstructured":"Chegireddy, C. and H. Hamacher. (1987). \u201cAlgorithms for Finding k-best Perfect Matchings.\u201d Discrete Applied Mathematics, 18, 155\u2013165.","journal-title":"Discrete Applied Mathematics"},{"key":"73_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.4153\/CJM-1976-019-4","volume":"28","author":"K.M. Chong","year":"1976","unstructured":"Chong, K.M. (1976). \u201cAn Induction Theorem for Rearrangements.\u201d Candadian Journal of Mathematics, 28, 154\u2013160.","journal-title":"Candadian Journal of Mathematics"},{"key":"73_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","volume":"11","author":"J. Climaco","year":"1982","unstructured":"Climaco, J. and E. Martins. (1982). \u201cA Bicriterion Shortest Path Algorithm.\u201d European Journal of Operational Research, 11, 399\u2013404.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"73_CR7","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.ejor.2003.10.002","volume":"160","author":"D. Dubois","year":"2005","unstructured":"D. Dubois and Ph. Fortemps (2005) \u201cSelecting Preferred Solutions in the Minimax Approach to Dynamic Programming Problems Under Flexible Constraints\u201d European Journal of Operational Research, 160(3), 582\u2013598.","journal-title":"European Journal of Operational Research"},{"key":"73_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/S0377-2217(02)00353-3","volume":"147","author":"M. Ehrgott","year":"2003","unstructured":"Ehrgott, M. and A. Skriver. (2003). \u201cSolving Biobjective Combinatorial Max-Ordering Problems by Ranking Methods and a Two-Phase Approach.\u201d European Journal of Operational Research, 147, 657\u2013664.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"73_CR9","first-page":"114","volume":"37","author":"V. Emelichev","year":"1988","unstructured":"Emelichev, V. and V. Perepelitsa. (1988). \u201cMultiobjective Problems on the Spanning Trees of a Graph.\u201d Soviet Math. Dokl., 37(1), 114\u2013117.","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"73_CR10","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D. (1998). \u201cFinding the k Shortest Paths.\u201d SIAM Journal on Computing, 28(2), 652\u2013673.","journal-title":"SIAM Journal on Computing"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Fishburn, P. (1970). Utility Theory for Decision Making. Wiley.","DOI":"10.21236\/AD0708563"},{"issue":"1","key":"73_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","volume":"6","author":"H. Gabow","year":"1977","unstructured":"Gabow, H. (1977). \u201cTwo Algorithms for Generating Weighted Spanning Trees in Order.\u201d SIAM Journal on Computing, 6(1), 139\u2013150.","journal-title":"SIAM Journal on Computing"},{"key":"73_CR13","unstructured":"Garey, M. and D. Johnson. (1979). Computers and Intractability. W.H. Freeman and company."},{"issue":"2","key":"73_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/mnsc.15.2.B18","volume":"15","author":"S. Gupta","year":"1968","unstructured":"Gupta, S. and J. Rosenhead. (1968). \u201cRobustness in Sequential Investment Decisions.\u201d Management Science, 15(2), 18\u201329.","journal-title":"Management Science"},{"key":"73_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02099691","volume":"57","author":"H. Hamacher","year":"1995","unstructured":"Hamacher, H. (1995). \u201cA Note on k-best Network Flows.\u201d Annals of Operations Research, 57, 65\u201372.","journal-title":"Annals of Operations Research"},{"key":"73_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02032304","volume":"52","author":"H. Hamacher","year":"1994","unstructured":"Hamacher, H. and G. Ruhe. (1994). \u201cOn Spanning Tree Problems with Multiple Objectives.\u201d Annals of Operations Research, 52, 209\u2013230.","journal-title":"Annals of Operations Research"},{"key":"73_CR17","doi-asserted-by":"crossref","unstructured":"Hansen, P. (1980). \u201cBicriterion Path Problems.\u201d In G. Fandel and T. Gal (Eds.), Multicriteria Decision Making.","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"73_CR18","unstructured":"Hardy, G.H., J.E. Littlewood, and G. P\u00f3lya. (1934). Inequalities. Cambridge University Press."},{"key":"73_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/1905540","volume":"21","author":"I. Herstein","year":"1953","unstructured":"Herstein, I. and J. Milnor. (1953). \u201cAn Axiomatic Approach to Measurable Utility.\u201d Econometrica, 21, 291\u2013297.","journal-title":"Econometrica"},{"issue":"1","key":"73_CR20","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.ejor.2005.01.031","volume":"174","author":"R. Hites","year":"2006","unstructured":"R. Hites, Y. De Smet, N. Risse, M. Salazar-Neumann and P. Vincke (2006) \u201cAbout the Applicability of MCDA to Some Robustness Problems\u201d European Journal of Operational Research, 174(1), 322\u2013332.","journal-title":"European Journal of Operational Research"},{"key":"73_CR21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2307\/3439089","volume":"69","author":"N. Jensen","year":"1967","unstructured":"Jensen, N. (1967). \u201cAn Introduction to Bernoullian Utility Theory.\u201d Swedish Journal of Economics, 69, 163\u2013183.","journal-title":"Swedish Journal of Economics"},{"key":"73_CR22","volume-title":"The Robust Shortest Path Problem with Interval Data","author":"O. Karasan","year":"2001","unstructured":"O. Karasan, M. Pinar and H. Yaman (2001) \u201cThe Robust Shortest Path Problem with Interval Data\u201d Bilkent University, Ankara, Turkey."},{"key":"73_CR23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ro:1999112","volume":"33","author":"M. Kostreva","year":"1999","unstructured":"Kostreva, M. and W. Ogryczak. (1999). \u201cLinear Optimization with Multiple Equitable Criteria.\u201d RAIRO Operations Research, 33, 275\u2013297.","journal-title":"RAIRO Operations Research"},{"issue":"2","key":"73_CR24","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.ejor.2003.06.010","volume":"158","author":"M. Kostreva","year":"2004","unstructured":"Kostreva, M., W. Ogryczak, and A. Wierzbicki. (2004). \u201cEquitable Aggregations and Multiple Criteria Analysis.\u201d European Journal of Operational Research, 158(2), 362\u2013377.","journal-title":"European Journal of Operational Research"},{"key":"73_CR25","doi-asserted-by":"crossref","unstructured":"Kouvelis, P. and G. Yu. (1997). Robust Discrete Optimization and its Applications. Kluwer Academic Publisher.","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"73_CR26","doi-asserted-by":"crossref","unstructured":"Kruskal, J. (1956). \u201cOn the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem.\u201d In Proc. Am. Math. Soc.","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"73_CR27","unstructured":"Marshall, W. and I. Olkin. (1979). Inequalities: Theory of Majorization and its Applications. London: Academic Press."},{"issue":"10","key":"73_CR28","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R. Montemanni","year":"2004","unstructured":"R. Montemanni and L. M. Gambardella (2004) \u201cAn Exact Algorithm for the Robust Shortest Path Problem with Interval Data\u201d Computers and Operations Research, 31(10) 1667\u20131680.","journal-title":"Computers and Operations Research"},{"key":"73_CR29","doi-asserted-by":"crossref","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. and S. Her. (1992). \u201cSolving Min-Max Shortest-Path Problems on a Network.\u201d Naval Research Logistics, 39, 669\u2013683.","journal-title":"Naval Research Logistics"},{"key":"73_CR30","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/S0377-2217(99)00240-4","volume":"122","author":"W. Ogryczak","year":"2000","unstructured":"Ogryczak, W. (2000). \u201cInequality Measures and Equitable Approaches to Location Problems.\u201d European Journal of Operational Research, 122, 374\u2013391.","journal-title":"European Journal of Operational Research"},{"key":"73_CR31","unstructured":"Perny, P. and O. Spanjaard. (2003). \u201cAn Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios.\u201d In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence. pp. 469\u2013476, Acapulco, Mexico."},{"issue":"4","key":"73_CR32","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1057\/jors.1972.72","volume":"23","author":"J. Rosenhead","year":"1972","unstructured":"Rosenhead, J., M. Elton, and S. Gupta. (1972). \u201cRobustness and Optimality as Criteria for Strategic Decisions.\u201d Operational Research Quaterly, 23(4), 413\u2013430.","journal-title":"Operational Research Quaterly"},{"key":"73_CR33","doi-asserted-by":"crossref","unstructured":"Roy, B. (1996). Multicriteria Methodology for Decision Aiding. Kluwer Academic Publisher.","DOI":"10.1007\/978-1-4757-2500-1"},{"issue":"3","key":"73_CR34","first-page":"141","volume":"23","author":"B. Roy","year":"1998","unstructured":"Roy, B. (1998). \u201cA Missing Link in OR-DA: Robustness Analysis.\u201d Foundations of Computing and Decision Sciences, 23(3), 141\u2013160.","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"73_CR35","unstructured":"Roy, B. (2002). \u201cRobustesse de quoi et vis-\u00e0-vis de quoi mais aussi robustesse pourquoi en aide \u00e0 la d\u00e9cision.\u201d Newsletter of the European Working Group Multicriteria Aid for Decisions, 3(6)."},{"key":"73_CR36","unstructured":"Sayin, S. and P. Kouvelis. (2002). \u201cRobustness and Efficiency: A Study of the Relationship and an Algorithm for the Bicriteria Discrete Optimization Problem.\u201d Working Paper, Olin School of Business, Washington University."},{"key":"73_CR37","unstructured":"Sen, A. (1997). On Economic Inequality. Clarendon Press, expanded ed."},{"key":"73_CR38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2307\/2554117","volume":"50","author":"A. Shorrocks","year":"1983","unstructured":"Shorrocks, A. (1983). \u201cRanking Income Distributions.\u201d Economica, 50, 3\u201317.","journal-title":"Economica"},{"issue":"4","key":"73_CR39","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"B.S. Stewart","year":"1991","unstructured":"Stewart, B.S. and C.C. White III. (1991). \u201cMultiobjective A*.\u201d Journal of the Association for Computing Machinery, 38(4), 775\u2013814.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"73_CR40","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0377-2217(97)00439-6","volume":"112","author":"P. Vincke","year":"1999a","unstructured":"Vincke, P. (1999a). \u201cRobust and Neutral Methods for Aggregating Preferences into an Outranking Relation.\u201d European Journal of Operational Research, 112(2), 405\u2013412.","journal-title":"European Journal of Operational Research"},{"key":"73_CR41","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1099-1360(199905)8:3<181::AID-MCDA242>3.0.CO;2-P","volume":"8","author":"P. Vincke","year":"1999b","unstructured":"Vincke, P. (1999b). \u201cRobust Solutions and Methods in Decision-Aid.\u201d Journal of Multicriteria Decision Analysis, 8, 181\u2013187.","journal-title":"Journal of Multicriteria Decision Analysis"},{"key":"73_CR42","unstructured":"von Neumann, J. and O. Morgenstern. (1947). Theory of Games and Economic Behavior. 2nd Ed. Princeton University Press."},{"key":"73_CR43","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BF01582247","volume":"33","author":"A. Warburton","year":"1985","unstructured":"Warburton, A. (1985). \u201cWorst Case Analysis of Greedy and Related Heuristics for Some Min-Max Combinatorial Optimization Problems.\u201d Mathematical Programming, 33, 234\u2013241.","journal-title":"Mathematical Programming"},{"key":"73_CR44","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0165-4896(81)90018-4","volume":"1","author":"J. Weymark","year":"1981","unstructured":"Weymark, J. (1981). \u201cGeneralized Gini Inequality Indices.\u201d Mathematical Social Sciences, 1, 409\u2013430.","journal-title":"Mathematical Social Sciences"},{"key":"73_CR45","doi-asserted-by":"crossref","first-page":"95","DOI":"10.2307\/1911158","volume":"55","author":"M. Yaari","year":"1987","unstructured":"Yaari, M. (1987). \u201cThe Dual Theory of Choice Under Risk.\u201d Econometrica, 55, 95\u2013115.","journal-title":"Econometrica"},{"key":"73_CR46","doi-asserted-by":"crossref","unstructured":"Yager, R. (1988). \u201cOn Ordered Weighted Averaging Aggregation Operators in Multicriteria Decision Making.\u201d In IEEE Trans. Systems, Man and Cybern. vol. 18, pp. 183\u2013190.","DOI":"10.1109\/21.87068"},{"key":"73_CR47","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"H. Yaman","year":"2001","unstructured":"Yaman, H., O. Kara\u015fan, and M. Pinar. (2001). \u201cThe Robust Spanning Tree Problem with Interval Data.\u201d Operations Research Letters, 29, 31\u201340.","journal-title":"Operations Research Letters"},{"issue":"6","key":"73_CR48","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"G. Yu","year":"1998","unstructured":"Yu, G. and J. Yang. (1998). \u201cOn the Robust Shortest Path Problem.\u201d Computers and Operations Research, 25(6), 457\u2013468.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0073-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0073-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0073-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:33Z","timestamp":1559153253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0073-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,14]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0073-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,14]]}}}