R. Carraway, L. Morin, and H. Moskowitz, Generalized dynamic programming for multicriteria optimization, European Journal of Operational Research, vol.44, issue.1, pp.95-104, 1990.
DOI : 10.1016/0377-2217(90)90318-6

K. Chong, An induction theorem for rearrangements, Journal canadien de math??matiques, vol.28, issue.1, pp.154-160, 1976.
DOI : 10.4153/CJM-1976-019-4

P. Dasgupta, P. Chakrabarti, and S. Desarkar, Utility of pathmax in partial order heuristic search, Information Processing Letters, vol.55, issue.6, pp.317-322, 1995.
DOI : 10.1016/0020-0190(95)00086-R

M. Ehrgott and X. Gandibleux, Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems, Computers & OR, vol.34, issue.9, pp.2674-2694, 2007.
DOI : 10.1007/978-3-642-56680-6_22

A. Felner, C. Moldenhauer, N. R. Sturtevant, and J. Schaeffer, Single-frontier bidirectional search, Twenty- Fourth AAAI Conference on Artificial Intelligence, 2010.

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 O. Spanjaard, OWA-based search in state space graphs with multiple cost functions, FLAIRS Conference, pp.86-91, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01311619

L. Galand, J. Lesca, and P. Perny, Dominance rules for the choquet integral in multiobjective dynamic programming, proceedings of IJCAI, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01372497

A. Goldberg and C. Harrelson, Computing the shortest path: A search meets graph theory, SODA, pp.156-165, 2005.

P. Hansen, Bicriterion path problems Multiple Criteria Decision Making: Theory and Applications, LNEMS 177, pp.109-127, 1980.

P. E. Hart, N. J. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

T. Hashimoto, K. Tenmoku, and K. Mitoh, A fast algorithm for finding better routes by AI search techniques, 1994.

H. Kaindl and G. Kainz, Bi-directionnal heuristic search reconsidered, Journal of Artificial Intelligence Research, vol.7, pp.283-317, 1997.

J. H. Kwa, BS???: An admissible bidirectional staged heuristic search algorithm, Artificial Intelligence, vol.38, issue.1, pp.95-109, 1989.
DOI : 10.1016/0004-3702(89)90069-6

E. Machuca, L. Mandow, J. Cruz, and A. Ruiz-sepulveda, An Empirical Comparison of Some Multiobjective Graph Search Algorithms, KI 2010: Advances in Artificial Intelligence, pp.238-245, 2010.
DOI : 10.1007/978-3-642-16111-7_27

L. Mandow, P. De-la-cruz, and J. , A new approach to multiobjective A * search, Proceedings of IJCAI-05, pp.218-223, 2005.

A. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, 1979.
DOI : 10.1007/978-0-387-68276-1

L. Mitten, Composition Principles for Synthesis of Optimal Multistage Processes, Operations Research, vol.12, issue.4, pp.610-619, 1964.
DOI : 10.1287/opre.12.4.610

P. Perny and O. Spanjaard, On preference-based search in state space graphs, Proceedings of AAAI-02, pp.751-756, 2002.

P. Perny and O. Spanjaard, An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios, Proceedings of the 19th conference on Uncertainty in Artificial Intelligence, pp.469-476, 2003.

P. Perny and O. Spanjaard, Near admissible algorithms for multiobjective search, European Conference on Artificial Intelligence (ECAI), pp.490-494, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01303000

I. Pohl, Bi-directional search. Machine Intelligence, pp.124-140, 1971.

A. Przybylski, X. Gandibleux, and M. Ehrgott, A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, Discrete Optimization, vol.7, issue.3, pp.149-165, 2010.
DOI : 10.1016/j.disopt.2010.03.005
URL : https://hal.archives-ouvertes.fr/hal-00485936

M. N. Rice and V. J. Tsotras, Bidirectional a search with additive approximation bounds. Shorrocks, A. 1983. Ranking income distributions, Economica, vol.50, pp.3-17, 2012.

F. Sourd and O. Spanjaard, A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem, INFORMS Journal on Computing, vol.20, issue.3, pp.472-484, 2008.
DOI : 10.1287/ijoc.1070.0260
URL : https://hal.archives-ouvertes.fr/hal-01170228

B. Stewart, I. White, and C. , Multiobjective A*, Journal of the ACM, vol.38, issue.4, pp.775-814, 1991.
DOI : 10.1145/115234.115368

C. White, B. Stewart, and R. Carraway, Multiobjective, preference-based search in acyclic OR-graphs, European Journal of Operational Research, vol.56, issue.3, pp.357-363, 1992.
DOI : 10.1016/0377-2217(92)90318-4