P. If and =. , 1 ? P j 2 such that P j 1 ? P i and the points of P j 2 are either dominated by points of P i (Figure 4.2b) or weakly dominated by interior points in the edges defined by two points of P i (Figure 4, p.then CSUB

. Comparison, =. Surrogatefamily, and . {10, 100}, regarding the A-metric and the computational time, for the Group 1, p.118

. Comparison, =. Surrogatefamily, and . {10, 100}, regarding the A-metric and the computational time, for the Group 3, p.120

. Comparison, . Init, O. Surrogatefamily-approximating-the, and =. For-h, 100}, regarding the A-metric and the computational time, for the Group 1, p.165

. Comparison, . Init, O. Surrogatefamily-approximating-the, and =. For-h, 100}, regarding the A-metric and the computational time, for the Group 2, p.166

. Comparison, . Init, O. Surrogatefamily-approximating-the, and =. For-h, 100}, regarding the A-metric and the computational time, for the Group 3, p.167

K. Bibliography-fotis-aisopos, T. Tserpes, and . Varvarigou, Resource management in software as a service using the knapsack problem model, International Journal of Production Economics, vol.141, issue.2, pp.465-477, 2013.
DOI : 10.1016/j.ijpe.2011.12.011

P. Yash, K. P. Aneja, and . Nair, Bicriteria transportation problem, Management Science, vol.25, issue.65, pp.73-78, 1979.

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2/3, pp.235-256, 2002.
DOI : 10.1023/A:1013689704352

E. Balas and E. Zemel, An Algorithm for Large Zero-One Knapsack Problems, Operations Research, vol.28, issue.5, pp.1130-1154, 1980.
DOI : 10.1287/opre.28.5.1130

S. Balev, N. Yanev, A. Fréville, and R. Andonov, A dynamic programming based reduction procedure for the multidimensional 0???1 knapsack problem, European Journal of Operational Research, vol.186, issue.1, pp.63-76, 2008.
DOI : 10.1016/j.ejor.2006.02.058
URL : https://hal.archives-ouvertes.fr/inria-00184771

M. Basseur and E. K. Burke, Indicator-based multi-objective local search, 2007 IEEE Congress on Evolutionary Computation, pp.3100-3107, 2007.
DOI : 10.1109/CEC.2007.4424867
URL : https://hal.archives-ouvertes.fr/hal-00609252

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

C. Bazgan, H. Hugot, and D. Vanderpooten, Implementing an efficient fptas for the 0???1 multi-objective knapsack problem, European Journal of Operational Research, vol.198, issue.1, pp.47-56, 2009.
DOI : 10.1016/j.ejor.2008.07.047

T. Bektas and O. Oguz, On separating cover inequalities for the multidimensional knapsack problem, Computers & Operations Research, vol.34, issue.6, pp.1771-1776, 2007.
DOI : 10.1016/j.cor.2005.05.032

R. Bellman, Dynamic Programming, p.43, 1957.

P. Harold and . Benson, An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem, Journal of Global Optimization, vol.13, issue.1, pp.1-24, 1998.

A. Donald, B. Berry, and . Fristedt, Bandit Problems: Sequential Allocation of Experiments, p.83, 1985.

E. Boros, On the complexity of the surrogate dual of 0???1 programming, Zeitschrift f??r Operations Research, vol.224, issue.3, pp.145-153, 1986.
DOI : 10.1007/BF01919175

V. Boyer, Contribution à la programmation en nombres entiers, p.53, 2007.

V. Boyer, M. Elkihel, and . Baz, Heuristics for the 0???1 multidimensional knapsack problem, European Journal of Operational Research, vol.199, issue.3, pp.658-664, 2009.
DOI : 10.1016/j.ejor.2007.06.068

V. Boyer, M. Baz, and . Elkihel, Solving knapsack problems on GPU, Computers & Operations Research, vol.39, issue.1, pp.42-47, 2012.
DOI : 10.1016/j.cor.2011.03.014
URL : https://hal.archives-ouvertes.fr/hal-01152223

M. E. Captivo, J. Clímaco, J. R. Figueira, E. Martins, and J. 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

V. Chvátal, Edmonds polytopes and a hierarchy of combinatorial problems. Discrete mathematics, pp.305-337, 1973.

T. Clausen, A. N. Hjorth, M. Nielsen, and D. Pisinger, The off-line group seat reservation problem, European Journal of Operational Research, vol.207, issue.3, pp.1244-1253, 2010.
DOI : 10.1016/j.ejor.2010.06.037

H. Crowder, E. L. Johnson, and M. W. Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research, vol.31, issue.5, pp.803-834, 1983.
DOI : 10.1287/opre.31.5.803

C. Gomes-da-silva, C. N. João, J. R. Clímaco, and . Figueira, A Scatter Search Method for the Bi-Criteria Multi-dimensional {0,1}-Knapsack Problem using Surrogate Relaxation, Journal of Mathematical Modelling and Algorithms, vol.3, issue.3, pp.183-208, 2004.
DOI : 10.1023/B:JMMA.0000038617.09620.02

C. Gomes-da-silva, J. R. Figueira, and J. Clímaco, Integrating partial optimization with scatter search for solving bi-criteria {0,1}-knapsack problems, European Journal of Operational Research, vol.177, issue.3, pp.1656-1677, 2007.
DOI : 10.1016/j.ejor.2005.10.013

C. Gomes-da-silva, C. N. João, J. R. Clímaco, and . Figueira, Core problems in bi-criteria -knapsack problems, Computers & Operations Research, vol.35, issue.7, pp.2292-2306, 2008.
DOI : 10.1016/j.cor.2006.11.001

K. Dächert and K. Klamroth, A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems, Journal of Global Optimization, vol.20, issue.2, pp.1-34, 2014.
DOI : 10.1007/s10898-014-0205-z

L. Dacosta, Á. Fialho, M. Schoenauer, and M. Sebag, Adaptive operator selection with dynamic multi-armed bandits, Proceedings of the 10th annual conference on Genetic and evolutionary computation, GECCO '08, pp.913-920, 2008.
DOI : 10.1145/1389095.1389272

G. B. Dantzig, Discrete-Variable Extremum Problems, Operations Research, vol.5, issue.2, pp.266-288, 1957.
DOI : 10.1287/opre.5.2.266

R. Ismael, G. L. De-farias-jr, and . Nemhauser, A polyhedral study of the cardinality constrained knapsack problem, Mathematical Programming, vol.96, issue.3, pp.439-467, 2003.

K. Deb, Multi-Objective Evolutionary Algorithms, Springer Handbook of Computational Intelligence, pp.995-1015, 2015.
DOI : 10.1007/978-3-662-43505-2_49

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, pp.182-197, 2002.
DOI : 10.1109/4235.996017

F. Degoutin and X. Gandibleux, Un retour d'expérience sur la résolution de problèmes combinatoires bi-objectifs, 5e journée du groupe de travail Programmation Mathématique MultiObjectif (PM20), p.66, 2002.

C. Delort, Algorithmes d'énumération implicite pour l'optimisation multi-objectifs exacte : exploration d'ensembles bornant et application aux problèmes de sac à dos et d'affectation, pp.55-56, 2011.

C. Delort and O. Spanjaard, Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem, Lecture Notes in Computer Science, vol.6049, issue.126, pp.253-265, 2010.
DOI : 10.1007/978-3-642-13193-6_22
URL : https://hal.archives-ouvertes.fr/hal-01291385

J. Dubois-lacoste, Anytime Local Search for Multi-Objective Combinatorial Optimization: Design, Analysis and Automatic Configuration, p.45, 2014.

M. E. Dyer, Calculating surrogate constraints, Mathematical Programming, vol.174, issue.1, pp.255-278, 1980.
DOI : 10.1007/BF01581647

M. Ehrgott, Approximation algorithms for combinatorial multicriteria optimization problems, International Transactions in Operational Research, vol.3, issue.3, pp.5-31, 2000.
DOI : 10.1016/S0377-2217(98)00016-2

M. Ehrgott, Multicriteria Optimization, p.28, 2005.
DOI : 10.1007/978-3-662-22199-0

M. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectrum, vol.22, issue.4, pp.425-460, 2000.
DOI : 10.1007/s002910000046
URL : https://hal.archives-ouvertes.fr/hal-00462047

M. Ehrgott and X. Gandibleux, Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems, Lecture Notes in Economics and Mathematical Systems, vol.507, pp.241-253, 2001.
DOI : 10.1007/978-3-642-56680-6_22

M. Ehrgott and X. Gandibleux, Multiobjective combinatorial optimization In Multiple Criteria Optimization ? State of the Art Annotated Bibliographic Surveys, pp.369-444, 2002.

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

M. Ehrgott and X. Gandibleux, Hybrid Metaheuristics for Multi-objective Combinatorial Optimization, Hybrid metaheuristics, pp.221-259, 2008.
DOI : 10.1007/978-3-540-78295-7_8
URL : https://hal.archives-ouvertes.fr/hal-00466658

M. Ehrgott and D. Tenfelde, Computation of ideal and Nadir values and implications for their use in MCDM methods, European Journal of Operational Research, vol.151, issue.1, pp.119-139, 2003.
DOI : 10.1016/S0377-2217(02)00595-7

M. Ehrgott, A. Löhne, and L. Shao, A dual variant of Benson???s ???outer approximation algorithm??? for multiple objective linear programming, Journal of Global Optimization, vol.20, issue.2, pp.757-778, 2012.
DOI : 10.1007/s10898-011-9709-y

T. Erlebach, H. Kellerer, and U. Pferschy, Approximating Multi-objective Knapsack Problems, Algorithms and Data Structures, pp.210-221, 2001.
DOI : 10.1007/3-540-44634-6_20

G. W. Evans, An Overview of Techniques for Solving Multiobjective Mathematical Programs, Management Science, vol.30, issue.11, pp.1268-1282, 1984.
DOI : 10.1287/mnsc.30.11.1268

R. José, G. Figueira, M. M. Tavares, and . Wiecek, Labeling algorithms for multiple objective integer knapsack problems, Computers and Operations Research, vol.37, issue.4, pp.700-711, 2010.

R. José, L. Figueira, M. Paquete, D. Simões, and . Vanderpooten, Algorithmic improvements on dynamic programming for the bi-objective 0,1 knapsack problem, Computational Optimization and Applications, vol.56, issue.43, pp.97-111, 2013.

R. José, P. Figueira, L. Correia, and . Paquete, Techniques for solution set compression in multiobjective optimization, Proceedings of the 23rd International Conference on Multiple Criteria Decision Making, p.55, 2015.

K. Florios, G. Mavrotas, and D. Diakoulaki, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, European Journal of Operational Research, vol.203, issue.1, pp.14-21, 2010.
DOI : 10.1016/j.ejor.2009.06.024

A. Fréville, The multidimensional 0???1 knapsack problem: An overview, European Journal of Operational Research, vol.155, issue.1, pp.1-21, 2004.
DOI : 10.1016/S0377-2217(03)00274-1

A. Fréville and G. Plateau, An exact search for the solution of the surrogate dual of the 0???1 bidimensional knapsack problem, European Journal of Operational Research, vol.68, issue.3, pp.413-421, 1993.
DOI : 10.1016/0377-2217(93)90197-U

A. Fréville and G. Plateau, An efficient preprocessing procedure for the multidimensional 0???1 knapsack problem, Discrete Applied Mathematics, vol.49, issue.1-3, pp.189-212, 1994.
DOI : 10.1016/0166-218X(94)90209-7

A. Fréville and G. Plateau, The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool, Journal of Heuristics, vol.2, issue.2, pp.147-167, 1996.

V. Gabrel and M. Minoux, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Operations Research Letters, vol.30, issue.4, pp.252-264, 2002.
DOI : 10.1016/S0167-6377(02)00124-4
URL : https://hal.archives-ouvertes.fr/hal-01150601

L. Sune, M. Gadegaard, L. R. Ehrgott, and . Nielsen, A cut-and-branch approach for a class of bi-objective combinatorial optimization problems, 23rd International Conference on Multiple Criteria Decision Making, p.43, 2015.

X. Gandibleux and A. Fréville, Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case, Journal of Heuristics, vol.6, issue.3, pp.361-383, 2000.
DOI : 10.1023/A:1009682532542
URL : https://hal.archives-ouvertes.fr/hal-00462046

X. Gandibleux and O. Perederieieva, Some observations on the bi-objective 01 bidimensional knapsack problem, pp.93-94, 2011.

X. Gandibleux, H. Morita, and N. Katoh, The Supported Solutions Used as a Genetic Information in a Population Heuristic, Evolutionary Multi-Criterion Optimization, pp.429-442, 2001.
DOI : 10.1007/3-540-44719-9_30

R. Michael, D. S. Garey, and . Johnson, Computers and intractability: a guide to NPcompleteness, p.23, 1979.

B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Mathematical Programming, vol.15, issue.1, pp.78-105, 1985.
DOI : 10.1007/BF02591863

G. Gens and E. Levner, Computational complexity of approximation algorithms for combinatorial problems, In Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.74, pp.292-300, 1979.
DOI : 10.1007/3-540-09526-8_26

M. Arthur and . Geoffrion, Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematics Analysis and Applications, vol.22, issue.26, pp.618-630, 1968.

F. Glover, A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem, Operations Research, vol.13, issue.6, pp.879-919, 1965.
DOI : 10.1287/opre.13.6.879

F. Glover, Surrogate Constraint Duality in Mathematical Programming, Operations Research, vol.23, issue.3, pp.434-451, 1975.
DOI : 10.1287/opre.23.3.434

F. Glover, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, European Journal of Operational Research, vol.230, issue.2, pp.212-225, 2013.
DOI : 10.1016/j.ejor.2013.04.010

F. Glover, A. Gary, and . Kochenberger, Handbook of metaheuristics, p.131, 2003.
DOI : 10.1007/b101874

F. Glover, M. Laguna, and R. Martí, Fundamentals of scatter search and path relinking, Control and cybernetics, vol.39, pp.653-684, 2000.

E. David and . Goldberg, Probability matching, the magnitude of reinforcement, and classifier system bidding, Machine Learning, pp.407-425, 1990.

R. E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society, vol.64, issue.5, pp.275-278, 1958.
DOI : 10.1090/S0002-9904-1958-10224-4

Y. Y. Haimes, L. S. Lasdon, and D. A. Wismer, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Transactions on Systems, Man, and Cybernetics, vol.1, pp.296-297, 1971.

S. Hanafi and A. Fréville, An efficient tabu search approach for the 0???1 multidimensional knapsack problem, European Journal of Operational Research, vol.106, issue.2-3, pp.659-675, 1998.
DOI : 10.1016/S0377-2217(97)00296-8

P. Hansen, Bicriterion Path Problems, Lecture Notes in Economics and Mathematical Systems, vol.177, pp.109-127, 1980.
DOI : 10.1007/978-3-642-48782-8_9

M. Hifi and H. Mhalla, Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. Discrete Optimization, pp.320-330, 2013.

R. R. Hill, Y. K. Cho, and J. T. Moore, Problem reduction heuristic for the 0???1 multidimensional knapsack problem, Computers & Operations Research, vol.39, issue.1, pp.19-26
DOI : 10.1016/j.cor.2010.06.009

H. Holger, T. Hoos, and . Stützle, Stochastic local search: Foundations and applications, p.45, 2004.

I. Website and C. , URL http://www-01.ibm.com/software, p.42, 2015.

P. Giorgio, . Ingargiola, F. James, and . Korsh, Reduction algorithm for zero-one single knapsack problems, Management science, vol.20, issue.53, pp.460-463, 1973.

H. Ishibuchi, Y. Hitotsuyanagi, N. Tsukamoto, and Y. Nojima, Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study, Multi-Objective Memetic Algorithms, pp.27-49, 2009.
DOI : 10.1007/978-3-540-88051-6_2

M. Varnamkhasti, Overview of the algorithms for solving the multidimensional knasack problem, Advanced Sutdies in Biology, vol.4, issue.48, pp.37-47, 2012.

A. Jaszkiewicz, On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study, European Journal of Operational Research, vol.158, issue.2, pp.418-433, 2004.
DOI : 10.1016/j.ejor.2003.06.015

J. Jorge, Nouvelles propositions pour la résolution exacte du sac à dos multi-objectif unidimensionnel en variables binaires, pp.67-91, 2010.

N. Jozefowiez, G. Laporte, and F. Semet, A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem, INFORMS Journal on Computing, vol.24, issue.4, pp.554-564, 2012.
DOI : 10.1287/ijoc.1110.0476
URL : https://hal.archives-ouvertes.fr/hal-00831912

H. Mark, R. L. Karwan, and . Rardin, Some relationships between lagrangian and surrogate duality in integer programming, Mathematical Programming, vol.17, issue.1, pp.320-334, 1979.

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

M. Khemakhem, B. Haddar, K. Chebil, and S. Hanafi, A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem, International Journal of Applied Metaheuristic Computing, vol.3, issue.4, pp.43-63, 2012.
DOI : 10.4018/jamc.2012100103

G. Kirlik and S. Say?n, Computing the nadir point for multiobjective discrete optimization problems, Journal of Global Optimization, vol.22, issue.1, p.29, 2014.
DOI : 10.1007/s10898-014-0227-6

G. Kirlik and S. Say?n, A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems, European Journal of Operational Research, vol.232, issue.3, pp.479-488, 2014.
DOI : 10.1016/j.ejor.2013.08.001

G. Kiziltan and E. Yucao?-glu, 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

D. Klabjan, G. L. Nemhauser, and C. A. Tovey, The complexity of cover inequality separation, Operations Research Letters, vol.23, issue.1-2, pp.35-40, 1998.
DOI : 10.1016/S0167-6377(98)00025-X

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.1002/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4

M. Laumanns, L. Thiele, and E. Zitzler, An adaptive scheme to generate the pareto front based on the epsilon-constraint method. Practical Approaches to Multi-Objective Optimization, pp.4461-4498, 2005.

B. Lokman and M. Köksalan, Finding all nondominated points of multi-objective integer programs, Journal of Global Optimization, vol.12, issue.1, pp.347-365, 2013.
DOI : 10.1007/s10898-012-9955-7

R. Helena, . Lourenço, C. Olivier, T. Martin, and . Stützle, Iterated local search, p.45, 2003.

A. Lucena and J. E. Beasley, Branch and cut algorithms Advances in Linear and Integer Programming, pp.187-221, 1996.

T. Lust and J. Teghem, Two-phase Pareto local search for the biobjective traveling salesman problem, Journal of Heuristics, vol.7, issue.2, pp.475-510, 2010.
DOI : 10.1007/s10732-009-9103-9

T. Lust and J. Teghem, The multiobjective multidimensional knapsack problem: a survey and a new approach, International Transactions in Operational Research, vol.7, issue.2, p.58, 2012.
DOI : 10.1111/j.1475-3995.2011.00840.x

O. Andrew and . Makhorin, Website of GLPK, 2015. URL http://www.gnu.org/software, p.42

S. Martello and P. Toth, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, European Journal of Operational Research, vol.1, issue.3, pp.169-175, 1977.
DOI : 10.1016/0377-2217(77)90024-8

S. Martello and P. Toth, Knapsack Problems : Algorithms and Computer Implementations, p.47, 1990.

S. Martello and P. Toth, An Exact Algorithm for the Two-Constraint 0???1 Knapsack Problem, Operations Research, vol.51, issue.5, pp.826-835, 2003.
DOI : 10.1287/opre.51.5.826.16757

S. Martello, D. Pisinger, and P. Toth, Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem, Management Science, vol.45, issue.3, pp.414-424, 1999.
DOI : 10.1287/mnsc.45.3.414

E. Queirós and V. Martins, On a multicriteria shortest path problem, European Journal of Operational Research, vol.16, pp.236-245, 1984.

J. Maturana, A. Fialho, F. Saubion, M. Schoenauer, F. Lardeux et al., Adaptive Operator Selection and Management in Evolutionary Algorithms, Autonomous Search, pp.161-189, 2012.
DOI : 10.1007/978-3-642-21434-9_7

G. Mavrotas, J. R. Figueira, and K. Florios, Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core, Applied Mathematics and Computation, vol.215, issue.7, pp.2502-2514, 2009.
DOI : 10.1016/j.amc.2009.08.045

G. Mavrotas, J. R. Figueira, and A. Antoniadis, Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems, Journal of Global Optimization, vol.169, issue.1, pp.589-606, 2011.
DOI : 10.1007/s10898-010-9552-6

M. Osorio and G. Cuaya, Hard Problem Generation for MKP, Sixth Mexican International Conference on Computer Science (ENC'05), pp.290-297, 2005.
DOI : 10.1109/ENC.2005.22

F. María-auxilio-osorio, P. Glover, and . Hammer, Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions, Annals of Operations Research, vol.117, issue.1/4, pp.71-93, 2002.
DOI : 10.1023/A:1021513321301

M. Özlen, B. A. Burton, and C. A. Macrae, Multi-Objective Integer Programming: An Improved Recursive Algorithm, Journal of Optimization Theory and Applications, vol.618, issue.3, pp.470-482, 2014.
DOI : 10.1007/s10957-013-0364-y

Ö. Özpeynirci and M. Köksalan, An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs, Management Science, vol.56, issue.12, pp.2302-2315, 2010.
DOI : 10.1287/mnsc.1100.1248

W. Manfred, G. Padberg, and . Rinaldi, Optimization of a 532-city symmetric traveling salesman problem by branch and cut, Operations Research Letters, vol.6, issue.1, pp.1-7, 1987.

E. Page, CONTINUOUS INSPECTION SCHEMES, Biometrika, vol.41, issue.1-2, pp.100-115, 1954.
DOI : 10.1093/biomet/41.1-2.100

L. Paquete and T. Stützle, A Two-Phase Local Search for the Biobjective Traveling Salesman Problem, Evolutionary Multi-Criterion Optimization, pp.479-493, 2003.
DOI : 10.1007/3-540-36970-8_34

V. Pareto, Manuel d'économie politique. F. Rouge, pp.1896-1920

O. Perederieieva, Bound sets for bi-objective bi-dimensional knapsack problem, pp.95-114, 2011.

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

A. Przybylski, X. Gandibleux, and M. Ehrgott, Two phase algorithms for the bi-objective assignment problem, European Journal of Operational Research, vol.185, issue.2, pp.509-533, 2008.
DOI : 10.1016/j.ejor.2006.12.054
URL : https://hal.archives-ouvertes.fr/hal-00461989

A. Przybylski, X. Gandibleux, and M. Ehrgott, A two phase method for multiobjective integer programming and its application to the assignment problem with three objectives . Discrete optmization, pp.149-165, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00485936

A. Przybylski, X. Gandibleux, and M. Ehrgott, A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme, INFORMS Journal on Computing, vol.22, issue.3, pp.371-386
DOI : 10.1287/ijoc.1090.0342
URL : https://hal.archives-ouvertes.fr/hal-00461784

J. Puchinger, G. R. Raidl, and U. Pferschy, The Core Concept for the Multidimensional Knapsack Problem, In Evolutionary Computation in Combinatorial Optimization Lecture Notes in Computer Science, vol.3906, pp.195-208, 2006.
DOI : 10.1007/11730095_17
URL : https://hal.archives-ouvertes.fr/hal-01299570

R. M. Ramos, S. Alonso, J. Sicilia, and C. Gonzalez, The problem of the optimal biobjective spanning tree, European Journal of Operational Research, vol.111, issue.3, pp.617-628, 1998.
DOI : 10.1016/S0377-2217(97)00391-3

C. R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, p.45, 1993.

M. Hershel, J. B. Safer, and . Orlin, Fast approximation schemes for multi-criteria combinatorial optimization, p.45, 1995.

M. Hershel, J. B. Safer, and . Orlin, Fast approximation schemes for multi-criteria flow, knapsack , and scheduling problems, p.55, 1995.

A. Schrijver, Theory of Linear and Integer Programming, p.22, 1986.

B. Schulze and K. Klamroth, Multiple objective optimization for multidimensional knapsack problems, 23rd International Conference on Multiple Criteria Decision Making, p.52, 2015.

B. Schulze, K. Klamroth, and L. Paquete, Transforming constraints into objectives: experiments with bidimensional knapsack problems, 22nd International Conference on Multiple Criteria Decision Making, p.52, 2013.

W. Shih, A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem, Journal of the Operational Research Society, vol.30, issue.4, pp.369-378, 1979.
DOI : 10.1057/jors.1979.78

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

T. Stidsen and K. A. Andersen, Optimized parallel branch and cut algorithm for biobjective tsp. Workshop Recent Advances in Multi-Objective Optimization, p.43, 2015.

A. Thesen, A recursive branch and bound algorithm for the multidimensional knapsack problem, Naval Research Logistics Quarterly, vol.19, issue.2, pp.341-353, 1975.
DOI : 10.1002/nav.3800220210

D. Thierens, An adaptive pursuit strategy for allocating operator probabilities, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.1539-1546, 2005.
DOI : 10.1145/1068009.1068251

F. Tricoire, Multi-directional local search, Computers & Operations Research, vol.39, issue.12, pp.3089-3101, 2012.
DOI : 10.1016/j.cor.2012.03.010

G. Tsaggouris and C. Zaroliagis, Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications, Algorithms and Computation, pp.389-398, 2006.
DOI : 10.1007/11940128_40

E. Lukata, U. , and J. Teghem, The two phases 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.

E. Lukata, U. , and J. Teghem, Solving multi-objective knapsack problem by a branch-and-bound procedure. Multicriteria Analysis, pp.269-278, 1997.

L. Igor and . Vasil-'ev, A cutting plane method for knapsack polytope, Journal of Computer and Systems Sciences International, vol.48, issue.1, pp.70-77, 2009.

B. Villarreal and M. H. Karwan, An interactive dynamic programming approach to multicriteria discrete programming, Journal of Mathematical Analysis and Applications, vol.81, issue.2, pp.524-544, 1981.
DOI : 10.1016/0022-247X(81)90080-9

T. Vincent, Caractérisation des solutions efficaces et algorithmes d'énumération exacts pour l'optimisation multiobjectif en variables mixtes binaires, p.43, 2013.

T. Vincent, F. Seipp, S. Ruzika, A. Przybylski, and X. Gandibleux, Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case, Computers & Operations Research, vol.40, issue.1, pp.498-509, 2013.
DOI : 10.1016/j.cor.2012.08.003
URL : https://hal.archives-ouvertes.fr/hal-00832803

M. Visée, J. Teghem, M. Pirlot, and E. 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

M. Weingartner and D. N. Ness, Methods for the Solution of the Multidimensional 0/1 Knapsack Problem, Operations Research, vol.15, issue.1, pp.83-103, 1967.
DOI : 10.1287/opre.15.1.83

A. Laurence and . Wolsey, Integer programming, p.42, 1998.

A. Laurence, G. L. Wolsey, and . Nemhauser, Integer and Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization. Wiley, p.23, 1999.

E. Zitzler and L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Transactions on Evolutionary Computation, vol.3, issue.4, pp.257-271, 1999.
DOI : 10.1109/4235.797969