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

J. E. Beasley and C. P. , A genetic algorithm for the set covering problem, European Journal of Operational Research, vol.94, issue.2, pp.392-404, 1996.
DOI : 10.1016/0377-2217(95)00159-X

V. Boyer, E. Baz, D. Elkihel, and M. , A dynamic programming method with dominance technique for the knapsack sharing problem, 2009 International Conference on Computers & Industrial Engineering, 2009.
DOI : 10.1109/ICCIE.2009.5223827

J. Brown, The Knapsack sharing, Operation Reaserch, pp.341-355, 1979.

J. Brown, Solving Knapsack sharing with general tradeoff fonctions, Mathematical Programming, pp.55-73, 1991.

P. Cappanera and M. Trubian, A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem, INFORMS Journal on Computing, vol.17, issue.1, pp.82-98, 2005.
DOI : 10.1287/ijoc.1030.0050

A. Caprara, D. Pisinger, and P. Toth, Exact Solution of the Quadratic Knapsack Problem, INFORMS Journal on Computing, vol.11, issue.2, pp.125-137, 1999.
DOI : 10.1287/ijoc.11.2.125

N. Cherfi and H. M. , A Column Generation Method for the Multiple-Choice multi dimensional knapsack problem, Combinatorial Optimization and Application, DOI. 10, 1007.

N. Cherfi and H. M. , Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem, International Journal of Operational Research, vol.5, issue.1, pp.89-109, 2009.
DOI : 10.1504/IJOR.2009.024531

URL : https://hal.archives-ouvertes.fr/hal-00308704

N. Cherfi, Méthodes de résolution hybrides pour lesprobì emes de type knapsack, 2008.

P. Chu and J. Beasley, A genetic algorithm for the multidimensional knapsack problem, Journal of Heuristics, vol.4, issue.1, pp.63-86, 1998.
DOI : 10.1023/A:1009642405419

F. Dammeyer and S. Voss, Dynamic tabu list management using the reverse elimination method, Annals of Operations Research, vol.15, issue.2, pp.31-46, 1993.
DOI : 10.1007/BF02022561

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

K. Dudinski and S. Walukiewicz, Exact methods for the knapsack problem and its generalizations, Mathematical Programming, vol.29, pp.231-249, 1984.

M. Ehrgott and X. Gandibleux, Multiple Criteria Optimization : State of the Art Annotated Bibliographical Surveys, 2002.
DOI : 10.1007/b101915

M. Elkihel, G. Authié, and F. Viader, An efficient hybrid dynamic algorithm to solve 0-1 knapsack problems, International Symposium on Combinatorial Optimization, 2002.

M. Elkihel and G. Plateau, A hybrid method for the 0-1 knapsack problem, 9` eme Symposium de Recherche Operationnelle, 1984.

M. Fischetti and A. Lodi, Local branching, Mathematical Programming, pp.23-47, 2003.
DOI : 10.1007/s10107-003-0395-5

M. Fischetti, C. Polo, and M. Scantamburlo, A lo-cal branching heuristic for mixed-integer programs with 2-Level Variables, pp.61-72, 2004.

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, The 0-1 bidimensional knapsack problem : towards an efficient high-level primitive tool, Journal of Heuristics, vol.2, pp.147-167, 1996.

D. Fayard and G. Plateau, Algorithmus 47. Ein Algorithmus f??r die L??sung des 0???1 Knapsack Problems, Computing, vol.25, issue.3, pp.269-287, 1982.
DOI : 10.1007/BF02241754

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

G. Gallo, P. L. Hammer, and B. Simeone, Quadratic knapsack problems, Mathematical Programming Study, vol.12, pp.132-149, 1980.
DOI : 10.1007/BFb0120892

M. R. Garey and J. D. , Computers and intractability : a guide to the theory of NP-completeness, 1979.

B. Gavish and H. Pirkul, Allocation of databases and processors in a distributing for data processing, Management of Distributed Data Processing, pp.215-231

P. C. Gilmore and R. E. Gomory, Multistage Cutting Stock Problems of Two and More Dimensions, Operations Research, vol.13, issue.1, pp.94-119, 1965.
DOI : 10.1287/opre.13.1.94

P. C. Gilmore and R. E. Gomory, The Theory and Computation of Knapsack Functions, Operations Research, vol.14, issue.6, pp.1045-1074, 1966.
DOI : 10.1287/opre.14.6.1045

P. C. Gilmore and R. E. Gomory, The Theory and Computation of Knapsack Functions, Operations Research, vol.14, issue.6, pp.879-919, 1966.
DOI : 10.1287/opre.14.6.1045

F. Glover, G. I. Kochenberger, J. Osman, and . Kelly, Critical Event Tabu Search for Multidimensional Knapsack Problems, Meta Heuristics : Theory and Applications, pp.407-427, 1996.
DOI : 10.1007/978-1-4613-1361-8_25

F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

F. Glover and M. Laguna, Tabu search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

L. Gens, Computational complexity of approximation algorithms for combinatorial problems, Mathematical Foundations of Computer Science, pp.292-300, 1979.
DOI : 10.1007/3-540-09526-8_26

C. Guéret and C. Prins, A new lower bound for the open-shop problem, Annals of Operations Research, vol.92, pp.165-183, 1999.
DOI : 10.1023/A:1018930613891

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, The steepest ascent mildest descent heuristic for combinatorial programming, Presented at the Congress on Numerical Methods in Combinatorial Optimization, 1986.

M. Hifi, S. Negre, O. Ahmed-mounir, and M. , Local branching-based algorithm for the disjunctively constrained knapsack problem, 2009 International Conference on Computers & Industrial Engineering, 2009.
DOI : 10.1109/ICCIE.2009.5223682

M. Hifi, O. Ahmed-mounir, and M. , Un algorithme augmenté pour leprobì eme du knapsack disjonctif, Congrès de la Société Française de Recherche Opérationnelle et d'Aidè a la Décision, Février, pp.10-12, 2009.

M. Hifi, M. Hallah, R. , O. Ahmed-mounir, and M. , Augmented rounding algorithms for the disjunctively constrained knapsack problems, Computational Optimization and Applications, 2009.

M. Hifi, H. Sadfi, and S. , An exact algorithm for the knapsack sharing problem, Computers & Operations Research, vol.32, issue.5, pp.1311-1324, 2005.
DOI : 10.1016/j.cor.2003.11.005

URL : https://hal.archives-ouvertes.fr/hal-00308682

M. Hifi and S. Sadfi, The knapsack sharing : an exact algorithm, Journal of Combinatorial Optimization, vol.6, issue.1, pp.35-55, 2002.
DOI : 10.1023/A:1013385216761

URL : https://hal.archives-ouvertes.fr/hal-00308682

M. Hifi, S. Sadfi, and A. Sbihi, An efficient algorithm for the knapsack sharing problem, Computational Optimization and Applications, vol.23, issue.1, pp.27-45, 2002.
DOI : 10.1023/A:1019920507008

URL : https://hal.archives-ouvertes.fr/hal-00023189

M. Hifi and M. Michrafy, A reactive local search-based algorithm for the disjunctively constrained knapsack problem, Journal of the Operational Research Society, vol.43, issue.6, pp.718-726, 2006.
DOI : 10.1016/0377-2217(95)00015-I

M. Hifi, M. Michrafy, and A. Sbihi, Heuristic algorithms for the multiple-choice multidimensional knapsack problem, Journal of the Operational Research Society, vol.15, issue.12, pp.1323-1332, 2004.
DOI : 10.1287/ijoc.15.3.267.16080

URL : https://hal.archives-ouvertes.fr/hal-00125572

M. Hifi, M. Michrafy, and A. Sbihi, A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem, Computational Optimization and Applications, vol.21, issue.3, pp.271-285, 2006.
DOI : 10.1007/s10589-005-3057-0

URL : https://hal.archives-ouvertes.fr/hal-00125573

M. Hifi and M. Michrafy, Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem, Computers & Operations Research, vol.34, issue.9, pp.2657-2673, 2007.
DOI : 10.1016/j.cor.2005.10.004

M. Hifi and C. Roucairol, Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems, Journal of Combinatorial Optimization, vol.5, issue.4, pp.465-494, 2001.
DOI : 10.1023/A:1011628809603

M. Hifi and V. Zissimopoulos, A recursive exact algorithm for weighted two-dimensional cutting, European Journal of Operational Research, vol.91, issue.3, pp.553-564, 1996.
DOI : 10.1016/0377-2217(95)00343-6

E. Horowitz and S. Sahni, Computing Partitions with Applications to the Knapsack Problem, Journal of the ACM, vol.21, issue.2, pp.277-292, 1974.
DOI : 10.1145/321812.321823

R. Hill and R. C. , The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance, Management Science, vol.46, issue.2, pp.302-317, 2000.
DOI : 10.1287/mnsc.46.2.302.11930

R. Hirabayashi, H. Suzuki, and N. Tuchiya, Optimal tool module design problem for NC machine tools, Journal of the Operations Research Society of Japan, vol.27, pp.205-229, 1983.

T. Ibaraki and M. Fukushima, Fortran77 optimization programming, 1991.

S. Khan, L. K. Manning, E. Akbar, and M. , Solving the knapsack problem for adaptive multimedia systems, Studia Informatica, an International Journal, Special Issue on Cutting, Packing and Knapsacking problems, vol.2, pp.154-174, 2002.

S. Khan, Quality adaptation in a multi-session adaptive multimedia system : model and architecture, 1998.

P. Kilby, P. Prosser, and P. Shaw, Guided local search for the vehicle routing problem, Proceeding of the 2nd International Conference on Mataheuristics(MIC97), pp.21-24, 1997.

L. J. Savage and L. J. , Three problems in capital rationing, Journal of Business, vol.28, pp.229-229, 1955.

M. Magazine and M. Chern, A Note on Approximation Schemes for Multidimensional Knapsack Problems, Mathematics of Operations Research, vol.9, issue.2, pp.244-247, 1984.
DOI : 10.1287/moor.9.2.244

M. Magazine and O. Oguz, A heuristic algorithm for the multidimensional zero-one knapsack problem, European Journal of Operational Research, vol.16, issue.3, pp.319-326, 1984.
DOI : 10.1016/0377-2217(84)90286-8

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 and P. Toth, Algorithms for Knapsack Problems, Annals of Discrete Mathematics, vol.31, pp.70-79, 1887.
DOI : 10.1016/S0304-0208(08)73237-7

S. Martello and P. Toth, A New Algorithm for the 0-1 Knapsack Problem, Management Science, vol.34, issue.5, pp.633-644, 1980.
DOI : 10.1287/mnsc.34.5.633

S. Martello and P. Toth, Knapsack problems : algorithms and computer implementations, 1990.

S. Martello and P. Toth, Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems, Operations Research, vol.45, issue.5, pp.768-778, 1997.
DOI : 10.1287/opre.45.5.768

S. Martello and P. Toth, A Bound and Bound algorithm for the zero-one multiple knapsack problem, Discrete Applied Mathematics, vol.3, issue.4, pp.275-288, 1981.
DOI : 10.1016/0166-218X(81)90005-6

S. Martello and P. Toth, A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem, Management Science, vol.30, issue.6, pp.765-771, 1984.
DOI : 10.1287/mnsc.30.6.765

M. Martello, D. Pisinger, and T. 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

M. Michrafy, ContributionàContributionà la résolution de quelquesprobì emes de type sac-` a-dos : méthodes exactes et heuristiques, 2005.

M. Moser, D. Jokanovic, and N. Shiratori, An algorithm for the multidimesional multiplechoice knapsack problem, IEECE Transactions on Fundamentals of Electronics, vol.80, pp.582-589, 1997.

M. R. Nauss, The 0???1 knapsack problem with multiple choice constraints, European Journal of Operational Research, vol.2, issue.2, pp.125-131, 1978.
DOI : 10.1016/0377-2217(78)90108-X

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

D. Pisinger, A minimal algorithm for the multiple-choice knapsack problem, European Journal of Operational Research, vol.83, issue.2, pp.394-410, 1995.
DOI : 10.1016/0377-2217(95)00015-I

D. Pisinger, An exact algorithm for large multiple knapsack problems, European Journal of Operational Research, vol.114, issue.3, pp.528-541, 1999.
DOI : 10.1016/S0377-2217(98)00120-9

D. Pisinger, An exact algorithm for large multiple knapsack problems, European Journal of Operational Research, vol.114, issue.3, pp.528-541, 1999.
DOI : 10.1016/S0377-2217(98)00120-9

D. Pisinger and M. M. Sigurd, Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem, INFORMS Journal on Computing, vol.19, issue.1, 2003.
DOI : 10.1287/ijoc.1060.0181

J. Richardson, M. Palmer, G. Liepins, and M. Hilliard, Some guidelines for genetic algorithms with penalty functions, Proceedings of the Third International Conference on Genetic Algorithms, pp.191-197, 1989.

M. Salkin, Letter to the Editor???On the Merit of the Generalized Origin and Restarts in Implicit Enumeration, Operations Research, vol.18, issue.3, pp.549-554, 1970.
DOI : 10.1287/opre.18.3.549

C. Tang, A max-min allocation problem ; its solutions and applications, Operations Reaserch, pp.359-367, 1988.

B. Thiongane, A. Nagih, and G. Plateau, Lagrangean heuristics combined with reoptimization for the 0-1 biknapsack problem, 2003.

Y. Toyoda, A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems, Management Science, vol.21, issue.12, pp.1417-1427, 1975.
DOI : 10.1287/mnsc.21.12.1417

E. P. Tsang and C. Voudouris, Fast local search and guided local search and their application to British Telecom's workforce scheduling problem, Operations Research Letters, vol.20, issue.3, pp.119-127, 1997.
DOI : 10.1016/S0167-6377(96)00042-9

M. Vasquez and Y. Vimont, Improved results on the 0???1 multidimensional knapsack problem, European Journal of Operational Research, vol.165, issue.1, pp.70-81, 2005.
DOI : 10.1016/j.ejor.2004.01.024

URL : https://hal.archives-ouvertes.fr/hal-00353909

C. Voudouris and E. P. Tsang, Partial constraint satisfaction problems and guided local search for combinatorial, Proceedings of Practical Application of Constraint Technology (PACT'96), pp.337-356, 1996.

C. Voudouris and E. P. Tsang, Guided local search and its application to the traveling salesman problem, European Journal of Operational Research, vol.113, issue.2, pp.469-499, 1999.
DOI : 10.1016/S0377-2217(98)00099-X

L. A. Wolsey, Integer Programming, 1998.

T. Yamada and S. Kataoka, Heuristic and exact algorithms for the disjunctively constrained knapsack problem, 2001.

T. Yamada, S. Kataoka, and K. Watanabe, Heuristic and exact algorithms for the disjunctively constrained knapsack problem, pp.2864-2870, 2002.

T. Yamada, M. Futakawa, and S. Kataoka, Some exact algorithms for the knapsack sharing problem, European Journal of Operational Research, vol.106, issue.1, pp.177-183, 1998.
DOI : 10.1016/S0377-2217(97)00165-3

T. Yamada and M. Futakawa, Heuristic and exact reduction algorithms for the Knapsack sharing problem, Computers and Operation Reaserch, vol.21, pp.961-967, 1997.