Y. R. Aneja and K. P. Nair, Bicriteria Transportation Problem, Management Science, vol.25, issue.1, pp.73-78, 1979.
DOI : 10.1287/mnsc.25.1.73

C. Bazgan, H. Hugot, and D. Vanderpooten, An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem, WEA, pp.406-419, 2007.
DOI : 10.1007/978-3-540-72845-0_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.8514

C. Bazgan, H. Hugot, and D. Vanderpooten, Solving efficiently the 0???1 multi-objective knapsack problem, Computers & Operations Research, vol.36, issue.1, pp.260-279, 2009.
DOI : 10.1016/j.cor.2007.09.009

G. Bitran and J. M. Rivera, A combined approach to solve binary multicriteria problems, Naval Research Logistics Quarterly, vol.19, issue.2, pp.181-201, 1982.
DOI : 10.1002/nav.3800290202

M. E. Captivo, J. Cì-imaco, J. Figueira, E. Martins, and J. L. Santos, Solving bicriteria 0?1 knapsack problems using a labeling algorithm, Computers & Operations Research, vol.30, issue.12, pp.1865-1886, 2003.
DOI : 10.1016/S0305-0548(02)00112-0

H. G. Daellenbach and C. A. De-kluyver, Note on Multiple Objective Dynamic Programming, Journal of the Operational Research Society, vol.31, issue.7, pp.591-594, 1980.
DOI : 10.1057/jors.1980.114

M. Ehrgott, Multicriteria Optimization, second edition, 2005.

M. Ehrgott and X. Gandibleux, Approximative solution methods for multiobjective combinatorial optimization, Top, vol.3, issue.1, pp.1-88, 2004.
DOI : 10.1007/s002910000046
URL : https://hal.archives-ouvertes.fr/hal-00462043

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

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, 2004.
DOI : 10.1007/978-3-540-24777-7

G. Kiziltan and E. Yucaoglu, An Algorithm for Multiobjective Zero-One Linear Programming, Management Science, vol.29, issue.12, pp.1444-1453, 1983.
DOI : 10.1287/mnsc.29.12.1444

K. Klamroth and M. M. Wiecek, Dynamic programming approaches to the multiple criteria knapsack problem, Naval Research Logistics (NRL), vol.38, issue.1, pp.57-76, 2000.
DOI : 10.1007/BF00246001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5542

P. D. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, Proceedings of the Fifth international IPCO conference, pp.389-403, 1996.
DOI : 10.1007/3-540-61310-2_29

G. Mavrotas and D. Diakoulaki, A branch and bound algorithm for mixed zero-one multiple objective linear programming, European Journal of Operational Research, vol.107, issue.3, pp.530-541, 1998.
DOI : 10.1016/S0377-2217(97)00077-5

D. Pisinger, A Minimal Algorithm for the 0-1 Knapsack Problem, Operations Research, vol.45, issue.5, pp.758-767, 1997.
DOI : 10.1287/opre.45.5.758

P. Serafini, Some considerations about computational complexity for multiobjective combinatorial problems, Recent advances and historical development of vector optimization, LNEMS 294, 1986.
DOI : 10.1007/978-3-642-46618-2_15

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. Ulungu and J. Teghem, The two-phase method: An efficient procedure to solve bi-objective combinatorial optimization problems, Foundations of Computing and Decision Sciences, vol.20, issue.2, pp.149-165, 1995.

B. Villareal and M. H. Karwan, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Mathematical Programming, pp.204-223, 1981.
DOI : 10.1007/BF01584241

M. Visée, J. Teghem, M. Pirlot, and B. Ulungu, Two-phases method and branch and bound procedures to solve the bi?objective knapsack problem, Journal of Global Optimization, vol.12, issue.2, pp.139-155, 1998.
DOI : 10.1023/A:1008258310679