H. Aissi, C. Bazgan, and D. Vanderpooten, Min???max and min???max regret versions of combinatorial optimization problems: A survey, European Journal of Operational Research, vol.197, issue.2, pp.427-438, 2009.
DOI : 10.1016/j.ejor.2008.09.012
URL : https://hal.archives-ouvertes.fr/hal-00158652

P. J. Brucker and H. W. Hamacher, k-optimal solution sets for some polynomially solvable scheduling problems, European Journal of Operational Research, vol.41, issue.2, pp.194-202, 1989.
DOI : 10.1016/0377-2217(89)90384-6

A. Chateauneuf and J. M. Tallon, Diversification, convex preferences and non-empty core in the Choquet expected utility model, Economic Theory, vol.19, issue.3, pp.509-523, 2002.
DOI : 10.1007/s001990000152
URL : https://hal.archives-ouvertes.fr/halshs-00174770

C. K. Chegireddy and H. W. Hamacher, Algorithms for finding K-best perfect matchings, Discrete Applied Mathematics, vol.18, issue.2, pp.155-165, 1987.
DOI : 10.1016/0166-218X(87)90017-5
URL : http://doi.org/10.1016/0166-218x(87)90017-5

G. Choquet, Theory of capacities Annales de l'Institut Fourier, pp.131-295, 1953.

J. Edmonds, Submodular Functions, Matroids, and Certain Polyhedra, International conference on combinatorics, pp.69-87, 1970.
DOI : 10.1007/3-540-36478-1_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.454.4060

M. Ehrgott, Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems, vol.491, pp.153-222, 2000.
DOI : 10.1007/978-3-662-22199-0

M. Ehrgott and X. Gandibleux, Multiple Criteria Optimization: State of the Art Surveys, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00470381

V. A. Emelichev and V. A. Perepelitsa, Multiobjective problems on the spanning trees of a graph, Soviet Math. Dokl, vol.37, issue.1, pp.114-117, 1988.

D. Eppstein, Finding the k Shortest Paths, SIAM Journal on Computing, vol.28, issue.2, pp.652-673, 1998.
DOI : 10.1137/S0097539795290477
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.3705

S. Fujishige, Submodular functions and Optimization, volume Annals of discrete mathematics, 58, 2005.

H. N. Gabow, Two Algorithms for Generating Weighted Spanning Trees in Order, SIAM Journal on Computing, vol.6, issue.1, pp.139-150, 1977.
DOI : 10.1137/0206011

L. Galand and P. Perny, Search for compromise solutions in multiobjective state space graphs, 17th European Conference on Artificial Intelligence, pp.93-97, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01351246

L. Galand and P. Perny, Search for Choquet-optimal paths under uncertainty, Proceedings of the 23rd conference on Uncertainty in Artificial Intelligence, pp.125-132, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01311609

L. Galand and O. Spanjaard, OWA-based search in state space graphs with multiple cost functions, 20th International Florida Artificial Intelligence Research Society Conference, pp.86-91, 2007.

C. Gonzales, P. Perny, and S. Queiroz, GAI-networks: Optimization, ranking and collective choice in combinatorial domains. Foundations of computing and decision sciences, pp.3-24, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01170369

M. Grabisch, The application of fuzzy integrals in multicriteria decision making, European Journal of Operational Research, vol.89, issue.3, pp.445-456, 1996.
DOI : 10.1016/0377-2217(95)00176-X

H. W. Hamacher, A note onK best network flows, Annals of Operations Research, vol.15, issue.1, pp.65-72, 1995.
DOI : 10.1007/978-3-642-66252-2

H. W. Hamacher and G. Ruhe, On spanning tree problems with multiple objectives, Annals of Operations Research, vol.36, issue.4, pp.209-230, 1994.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

P. Hansen, Bicriterion Path Problems, Multicriteria Decision Making, 1980.
DOI : 10.1007/978-3-642-48782-8_9

J. Jaffray, ON THE MAXIMUM-ENTROPY PROBABILITY WHICH IS CONSISTENT WITH A CONVEX CAPACITY, Fuzziness and Knowledge-Based Systems (IJUFKS), pp.27-34, 1995.
DOI : 10.1142/S0218488595000049

V. M. Jiménez and A. Marzal, A Lazy Version of Eppstein???s K Shortest Paths Algorithm, Experimental and Efficient Algorithms, Second International Workshop, WEA'03, pp.179-190, 2003.
DOI : 10.1007/3-540-44867-5_14

F. Kappel and A. V. Kuntsevich, An implementation of Shor's r-algorithm, Computational Optimization and Applications, vol.15, issue.2, pp.193-205, 2000.
DOI : 10.1023/A:1008739111712

N. Katoh, T. Ibaraki, and H. Mine, Minimum Spanning Trees, SIAM Journal on Computing, vol.10, issue.2, pp.247-255, 1981.
DOI : 10.1137/0210017

P. Kouvelis and G. Yu, Robust discrete optimization and its applications, 1997.
DOI : 10.1007/978-1-4757-2620-6

L. Lovász, Submodular functions and convexity, Mathematical Programming ? The State of the Art, pp.235-257, 1983.
DOI : 10.1007/978-3-642-68874-4_10

E. Q. Martins, On a multicriteria shortest path problem, European Journal of Operational Research, vol.16, issue.2, pp.236-245, 1984.
DOI : 10.1016/0377-2217(84)90077-8

I. Murthy and S. S. Her, Solving min-max shortest-path problems on a network, Naval Research Logistics, vol.35, issue.5, pp.669-683, 1992.
DOI : 10.1145/321921.321934

W. Ogryczak, Inequality measures and equitable approaches to location problems, European Journal of Operational Research, vol.122, issue.2, pp.374-391, 2000.
DOI : 10.1016/S0377-2217(99)00240-4

W. Ogryczak and T. Sliwinski, On Optimization of the Importance Weighted OWA Aggregation of Multiple Criteria, Computational Science and Its Applications ? ICCSA, pp.804-817, 2007.
DOI : 10.1007/978-3-540-74472-6_66

J. M. Paixão, E. Q. Martins, M. S. Rosa, and J. L. Santos, The determination of the path with minimum-cost norm value, Networks, vol.35, issue.4, pp.184-196, 2003.
DOI : 10.1090/trans2/158/18

C. H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of Web sources, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.86-92, 2000.
DOI : 10.1109/SFCS.2000.892068

P. Perny, O. Spanjaard, and L. X. Storme, A decision-theoretic approach to robust optimization in multivalued graphs, Annals of Operations Research, vol.25, issue.6, pp.317-341, 2006.
DOI : 10.1145/115234.115368
URL : https://hal.archives-ouvertes.fr/hal-01170404

J. Quiggin, Generalized expected utility theory -The rank-dependent model, Kluwer Academic, 1993.

D. Schmeidler, Integral representation without additivity, Proceedings of the American Mathematical Society, vol.97, issue.2, pp.255-261, 1986.
DOI : 10.1090/S0002-9939-1986-0835875-8

D. Schmeidler, Subjective Probability and Expected Utility without Additivity, Econometrica, vol.57, issue.3, pp.571-587, 1989.
DOI : 10.2307/1911053
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4096

G. Shafer, A Mathematical Theory of Evidence, 1976.

L. S. Shapley, Cores of convex games, International Journal of Game Theory, vol.57, issue.1, pp.11-22, 1971.
DOI : 10.5802/aif.53

R. E. Steuer and E. Choo, An interactive weighted Tchebycheff procedure for multiple objective programming, Mathematical Programming, vol.19, issue.3, pp.326-344, 1983.
DOI : 10.1007/978-3-642-48782-8_32

R. E. Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, 1983.
DOI : 10.1137/1.9781611970265

V. Torra, The weighted OWA operator, International Journal of Intelligent Systems, vol.12, issue.2, pp.153-166, 1997.
DOI : 10.1002/(SICI)1098-111X(199702)12:2<153::AID-INT3>3.0.CO;2-P

P. Vincke, Robust solutions and methods in decision-aid, Journal of Multi-Criteria Decision Analysis, vol.16, issue.3, pp.181-187, 1999.
DOI : 10.1007/978-1-4757-2620-6

M. E. Yaari, The Dual Theory of Choice under Risk, Econometrica, vol.55, issue.1, pp.95-115, 1987.
DOI : 10.2307/1911158

R. R. Yager, On ordered weighted averaging aggregation operators in multicriteria decisionmaking, IEEE Transactions on Systems, Man, and Cybernetics, vol.18, issue.1, pp.183-190, 1988.
DOI : 10.1109/21.87068

G. Yu and J. Yang, On the Robust Shortest Path Problem, Computers & Operations Research, vol.25, issue.6, pp.457-468, 1998.
DOI : 10.1016/S0305-0548(97)00085-3