C. Blum and A. Roli, Metaheuristics in combinatorial optimization, ACM Computing Surveys, vol.35, issue.3, pp.268-308, 2003.
DOI : 10.1145/937503.937505
URL : https://hal.archives-ouvertes.fr/hal-01224683

H. Hoos and T. Stützle, Stochastic Local Search ? Foundations and Applications, 2005.

C. Cotta, A study of hybridisation techniques and their application to the design of evolutionary algorithms, AI Communications, vol.11, pp.3-4, 1998.

I. Dumitrescu and T. Stuetzle, Combinations of Local Search and Exact Algorithms, Applications of Evolutionary Computation, pp.211-223, 2003.
DOI : 10.1007/3-540-36605-9_20

C. Blum, J. Puchinger, G. R. Raidl, and A. Roli, A brief survey on hybrid metaheuristics, Proceedings of BIOMA 2010

C. Blum, J. Puchinger, G. R. Raidl, and A. Roli, Hybrid metaheuristics Hybrid Optimization: The 10 Years of CPAIOR, pp.305-336, 2010.

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

Z. Michalewicz and P. Siarry, Feature cluster on adaptation of discrete metaheuristics to continuous optimization, European Journal of Operational Research, vol.185, issue.3, pp.1060-1273, 2008.
DOI : 10.1016/j.ejor.2006.09.009

K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution, 2005.
DOI : 10.1007/978-3-642-30504-7_8

D. Molina, M. Lozano, C. García-martínez, and F. Herrera, Memetic Algorithms for Continuous Optimisation Based on Local Search Chains, Evolutionary Computation, vol.3242, issue.1, pp.27-63, 2010.
DOI : 10.1109/ICSMC.2001.972910

A. P. Engelbrecht, Fundamentals of Computational Swarm Intelligence, 2005.

C. Cotta, E. Talbi, and E. Alba, Parallel Metaheuristics?A New Class of Algorithms, Ch. Parallel Hybrid Metaheuristics, pp.347-370, 2005.

E. Talbi, Metaheuristics: From Design to Implementation, 2009.
DOI : 10.1002/9780470496916
URL : https://hal.archives-ouvertes.fr/hal-00750681

S. Cahon, N. Melab, and E. Talbi, ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics, Journal of Heuristics, vol.10, issue.3, pp.357-380, 2004.
DOI : 10.1023/B:HEUR.0000026900.92269.ec

P. Moscato, Memetic algorithms: A short introduction New Ideas in Optimization, pp.219-234, 1999.

N. Krasnogor and J. Smith, A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design Issues, IEEE Transactions on Evolutionary Computation, vol.9, issue.5, pp.474-488, 2005.
DOI : 10.1109/TEVC.2005.850260

T. Stützle, Iterated local search for the quadratic assignment problem, European Journal of Operational Research, vol.174, issue.3, pp.1519-1539, 2006.
DOI : 10.1016/j.ejor.2005.01.066

T. Stützle, Local Search Algorithms for Combinatorial Problems -Analysis , Algorithms and New Applications, DISKI -Dissertationen zur Künstlichen Intelligenz, infix, 1999.

H. R. Lourenço, O. Martin, and T. Stützle, Iterated Local Search, Handbook of Metaheuristics of International Series in Operations Research & Management Science, pp.321-353, 2002.
DOI : 10.1007/0-306-48056-5_11

C. Walshaw, Multilevel Refinement for Combinatorial Optimisation Problems, Annals of Operations Research, vol.131, issue.1-4, pp.325-372, 2004.
DOI : 10.1023/B:ANOR.0000039525.80601.15

C. W. Blum, Multilevel refinement for combinatorial optimisation: Boosting metaheuristic performance, pp.261-289

A. Brandt, Multilevel computations: Review and recent developments Multigrid Methods: Theory, Applications, and Supercomputing, Proceedings of the 3rd Copper Mountain Conference on Multigrid Methods, pp.35-62, 1988.

C. Walshaw and M. Cross, Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm, SIAM Journal on Scientific Computing, vol.22, issue.1, pp.63-80, 2000.
DOI : 10.1137/S1064827598337373

C. Walshaw, A Multilevel Approach to the Travelling Salesman Problem, Operations Research, vol.50, issue.5, pp.862-877, 2002.
DOI : 10.1287/opre.50.5.862.373

I. O. Oduntana, M. Toulouse, R. Baumgartner, C. Bowman, R. Somorjai et al., A multilevel tabu search algorithm for the feature selection problem in biomedical data, Computers & Mathematics with Applications, vol.55, issue.5, pp.1019-1033, 2008.
DOI : 10.1016/j.camwa.2006.12.098

S. Pirkwieser and G. R. , Multilevel Variable Neighborhood Search for Periodic Routing Problems, Proceedings of EvoCOP 2010 ? 10th European Conference on Evolutionary Computation in Combinatorial Optimization, pp.226-238, 2010.
DOI : 10.1007/978-3-642-12139-5_20

M. Lozano and C. García-martínez, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report, Computers & Operations Research, vol.37, issue.3, pp.481-497, 2010.
DOI : 10.1016/j.cor.2009.02.010

M. G. Resende, R. Martí, M. Gallego, and A. Duarte, GRASP and path relinking for the max???min diversity problem, Computers & Operations Research, vol.37, issue.3, pp.498-508, 2010.
DOI : 10.1016/j.cor.2008.05.011

D. Pisinger, Core Problems in Knapsack Algorithms, Operations Research, vol.47, issue.4, pp.570-575, 1999.
DOI : 10.1287/opre.47.4.570

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

J. Lazi´clazi´c, S. Hanafi, N. Mladenovi´cmladenovi´c, and D. Uro?evi´uro?evi´c, Variable neighbourhood decomposition search for 0???1 mixed integer programs, Computers & Operations Research, vol.37, issue.6, pp.1055-1067, 2010.
DOI : 10.1016/j.cor.2009.09.010

S. Gilmour and M. Dras, Kernelization as Heuristic Structure for the Vertex Cover Problem, Proceedings of ANTS 2006 ? 5th International Workshop on Ant Colony Optimization and Swarm Intelligence, pp.452-459, 2006.
DOI : 10.1007/11839088_45

E. K. Burke, G. Kendall, J. Newall, E. Hart, P. Ross et al., Hyper-Heuristics: An Emerging Direction in Modern Search Technology, pp.457-474
DOI : 10.1007/0-306-48056-5_16

F. Glover, Surrogate Constraints, Operations Research, vol.16, issue.4, pp.741-749, 1968.
DOI : 10.1287/opre.16.4.741

C. Fleurent and F. Glover, Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory, INFORMS Journal on Computing, vol.11, issue.2, pp.198-204, 1999.
DOI : 10.1287/ijoc.11.2.198

T. Kanazawa and K. Yasuda, Proximate Optimality Principle Based Tabu Search, IEEJ Transactions on Electronics, Information and Systems, vol.124, issue.3, pp.912-920, 2004.
DOI : 10.1541/ieejeiss.124.912

R. Montemanni and D. H. Smith, Heuristic manipulation, tabu search and frequency assignment, Computers & Operations Research, vol.37, issue.3, pp.543-551, 2010.
DOI : 10.1016/j.cor.2008.08.006

A. A. Chaves, F. A. Correa, and L. A. Lorena, Clustering Search Heuristic for the Capacitated p-Median Problem, Innovations in Hybrid Intelligent Systems of Advances in Soft Computing, pp.136-143, 2008.
DOI : 10.1007/978-3-540-74972-1_19

Y. Chen, Y. Lu, and G. Yang, Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling, The International Journal of Advanced Manufacturing Technology, vol.45, issue.6, pp.9-10, 2008.
DOI : 10.1007/s00170-006-0904-9

S. Boettcher and A. G. Percus, Nature's way of optimizing, Artificial Intelligence, vol.119, issue.1-2, pp.275-286, 2000.
DOI : 10.1016/S0004-3702(00)00007-2

X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and L. M. Wang, An improved GA and a novel PSO-GA-based hybrid algorithm, Information Processing Letters, vol.93, issue.5, pp.255-261, 2005.
DOI : 10.1016/j.ipl.2004.11.003

P. Greistorfer, A Tabu Scatter Search Metaheuristic for the Arc Routing Problem, Computers & Industrial Engineering, vol.44, issue.2, pp.249-266, 2003.
DOI : 10.1016/S0360-8352(02)00178-X

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principle and Practice of Constraint Programming ? CP98, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

D. Applegate and W. Cook, A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing, vol.3, issue.2, pp.149-156, 1991.
DOI : 10.1287/ijoc.3.2.149

G. Pesant and M. Gendreau, A view of local search in constraint programming, Principles and Practice of Constraint Programming -CP'96, pp.353-366, 1996.
DOI : 10.1007/3-540-61551-2_86

G. Pesant and M. Gendreau, A Constraint Programming Framework for Local Search Methods, Journal of Heuristics, vol.5, issue.3, pp.255-279, 1999.
DOI : 10.1023/A:1009694016861

P. Shaw, B. De-backer, and V. Furnon, Improved local search for CP toolkits, Annals of Operations Research, vol.115, issue.1/4, pp.31-50, 2002.
DOI : 10.1023/A:1021188818613

L. Perron, P. Shaw, and V. Furnon, Propagation Guided Large Neighborhood Search, Principles and Practice of Constraint Programming ? CP 2004, pp.468-481, 2004.
DOI : 10.1007/978-3-540-30201-8_35

]. R. Ahuja, ¨. O. Ergun, J. Orlin, and A. Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.75-102, 2002.
DOI : 10.1016/S0166-218X(01)00338-9

M. Chiarandini, I. Dumitrescu, and T. S. Blum, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, pp.117-150
DOI : 10.1007/978-3-540-78295-7_5

C. Solnon, Ant Colony Optimization and Constraint Programming, 2010.
DOI : 10.1002/9781118557563
URL : https://hal.archives-ouvertes.fr/hal-01483570

M. Dorigo and T. Stützle, Ant Colony Optimization, 2004.

C. Blum, Ant colony optimization: Introduction and recent trends, Physics of Life Reviews, vol.2, issue.4, pp.353-373, 2005.
DOI : 10.1016/j.plrev.2005.10.001

B. Meyer, Hybrids of constructive meta-heuristics and constraint programming: A case study with ACO, pp.151-183

S. Prestwich, The Relation Between Complete and Incomplete Search, pp.63-83
DOI : 10.1007/978-3-540-78295-7_3

M. Khichane, P. Albert, and C. Solnon, Integration of ACO in a Constraint Programming Language, Proceedings of ANTS 2008 ? 6th International Workshop on Ant Colony Optimization and Swarm Intelligence, pp.84-95, 2008.
DOI : 10.1007/978-3-540-87527-7_8

M. Khichane, P. Albert, and C. Solnon, Strong Combination of Ant Colony Optimization with Constraint Programming Optimization, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ? CPAIOR 2010, pp.232-245, 2010.
DOI : 10.1007/978-3-642-13520-0_26
URL : https://hal.archives-ouvertes.fr/hal-01492973

M. Lombardi, M. Milano, A. Roli, and A. Zanarini, Deriving Information from Sampling and Diving, Emergent Perspectives in Artificial Intelligence ? AI*IA 2009, pp.82-91, 2009.
DOI : 10.1007/978-3-642-10291-2_9

F. Focacci, F. Laburthe, and A. Lodi, Local search and constraint programming, pp.369-403

J. C. Beck, Solution-guided multi-point constructive search for job shop scheduling, Journal of Artificial Intelligence Research, vol.29, pp.49-77, 2007.

J. Watson and J. Beck, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, Lecture Notes in Computer Science, vol.5015, pp.263-277, 2008.
DOI : 10.1007/978-3-540-68155-7_21

S. Prestwich, S. Tarim, R. Rossi, and B. Hnich, Evolving Parameterised Policies for Stochastic Constraint Programming, rinciples and Practice of Constraint Programming ? CP 2009, pp.684-691, 2009.
DOI : 10.1007/11754602_10

Z. Kiziltan, A. Lodi, M. Milano, and F. Parisini, CP-Based Local Branching, Principles and Practice of Constraint Programming ? CP 2007, pp.847-855, 2007.
DOI : 10.1007/978-3-540-74970-7_63

M. Trick and H. Yildiz, A Large Neighborhood Search Heuristic for Graph Coloring, Lecture Notes in Computer Science, vol.4510, pp.346-360, 2007.
DOI : 10.1007/978-3-540-72397-4_25

M. L. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.

W. D. Harvey, Nonsystematic backtracking search, 1995.

W. D. Harvey and M. L. Ginsberg, Limited discrepancy search, Proceedings of IJCAI 1995 ? 14th International Joint Conference on Artificial Intelligence, pp.607-615, 1995.

M. Milano and A. Roli, On the relation between complete and incomplete search: an informal discussion, Proceedings of CP-AI-OR'02 ? Fourth Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, pp.237-250, 2002.

M. Dell-'amico and A. Lodi, On the Integration of Metaheuristic Strategies in Constraint Programming, Metaheuristic Optimization via Memory and Evolution, pp.357-371, 2002.
DOI : 10.1007/0-387-23667-8_16

N. Jussien and O. Lhomme, Local search with constraint propagation and??conflict-based heuristics, Artificial Intelligence, vol.139, issue.1, pp.21-45, 2002.
DOI : 10.1016/S0004-3702(02)00221-7
URL : https://hal.archives-ouvertes.fr/hal-00869124

A. Schaerf, Combining local search and look-ahead for scheduling and constraint satisfaction problems, Proceedings of IJ- CAI 1997 ? 15th International Joint Conference on Artificial Intelligence, pp.1254-1259, 1997.

S. Prestwich, Combining the scalability of local search with the pruning techniques of systematic search, Annals of Operations Research, vol.115, issue.1/4, pp.51-72, 2002.
DOI : 10.1023/A:1021140902684

D. P. Bertsekas, J. N. Tsitsiklis, and C. Wu, Rollout algorithms for combinatorial optimization, Journal of Heuristics, vol.3, issue.3, pp.245-262, 1997.
DOI : 10.1023/A:1009635226865

T. A. Feo and M. G. Resende, Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, vol.68, issue.2, pp.109-133, 1995.
DOI : 10.1007/BF01096763

P. S. Ow and T. E. Morton, Filtered beam search in scheduling???, International Journal of Production Research, vol.26, issue.1, pp.297-307, 1988.
DOI : 10.1080/00207548208947802

C. Blum, C. Cotta, A. J. Fernández, and J. E. Gallardo, A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem, Proceedings of EvoCOP 2007 ? Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, pp.36-47, 2007.
DOI : 10.1007/978-3-540-71615-0_4

V. Maniezzo, Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem, INFORMS Journal on Computing, vol.11, issue.4, pp.358-369, 1999.
DOI : 10.1287/ijoc.11.4.358

V. Maniezzo and A. Carbonaro, An ANTS heuristic for the frequency assignment problem, Future Generation Computer Systems, vol.16, issue.8, pp.927-935, 2000.
DOI : 10.1016/S0167-739X(00)00046-7

V. Maniezzo and M. Roffilli, VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH, Cybernetics and Systems, vol.3, issue.4, pp.395-424, 2008.
DOI : 10.1007/BF02099703

C. Blum, Beam-ACO???hybridizing ant colony optimization with beam search: an application to open shop scheduling, Computers & Operations Research, vol.32, issue.6, pp.1565-1591, 2005.
DOI : 10.1016/j.cor.2003.11.018

C. Blum, Beam-ACO for Simple Assembly Line Balancing, INFORMS Journal on Computing, vol.20, issue.4, pp.618-627, 2008.
DOI : 10.1287/ijoc.1080.0271

M. López-ibáñez and C. Blum, Beam-ACO for the travelling salesman problem with time windows, Computers & Operations Research, vol.37, issue.9, pp.1570-1583, 2010.
DOI : 10.1016/j.cor.2009.11.015

M. Mastrolilli and C. Blum, On the use of different types of knowledge in metaheuristics based on constructing solutions, Engineering Applications of Artificial Intelligence, vol.23, issue.5, pp.650-659, 2010.
DOI : 10.1016/j.engappai.2010.01.018

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372

S. Mitrovi´cmitrovi´c-mini´cmini´c and A. P. Maniezzo, Variable intensity local search, pp.245-252

M. Prandtstetter and G. R. , An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem, European Journal of Operational Research, vol.191, issue.3
DOI : 10.1016/j.ejor.2007.04.044

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

P. Hansen, N. Mladenovi´cmladenovi´c, and D. Urosevi´curosevi´c, Variable neighborhood search and local branching, Computers & Operations Research, vol.33, issue.10, pp.3034-3045, 2006.
DOI : 10.1016/j.cor.2005.02.033

E. Danna, E. Rothberg, and C. L. Pape, Exploring relaxation induced neighborhoods to improve MIP solutions, Mathematical Programming, vol.9, issue.1, pp.71-90, 2005.
DOI : 10.1007/s10107-004-0518-7

C. Archetti, G. Guastaroba, and M. G. Speranza, An ILP-refined tabu search for the selective arc routing problem with penalties, Dörner et al. [12], pp.61-82

R. De-franceschi, M. Fischetti, and P. Toth, A new ILP-based refinement heuristic for Vehicle Routing Problems, Mathematical Programming, vol.115, issue.2-3, pp.471-499, 2006.
DOI : 10.1007/s10107-005-0662-8

T. Oncan, S. N. Kabadi, K. P. Nair, and A. P. Punnen, VLSN search algorithms for partitioning problems using matching neighbourhoods, Journal of the Operational Research Society, vol.41, issue.3, pp.388-398, 2008.
DOI : 10.1287/opre.41.5.935

S. Ropke and D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.40, issue.4, pp.455-472, 2006.
DOI : 10.1287/trsc.1050.0135

S. Pirkwieser and G. R. , Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem, Proceedings of HM 2010 ? Seventh International Workshop on Hybrid Metaheuristics, pp.174-189, 2010.
DOI : 10.1007/978-3-642-16054-7_13

A. Nagar, S. S. Heragu, and J. Haddock, A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem, Annals of Operations Research, vol.23, issue.3, pp.397-414, 1995.
DOI : 10.1007/BF02125405

D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, On the solution of the traveling salesman problem, Documenta Mathematica Extra Volume ICM III, pp.645-656, 1998.

D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics, 2007.

C. Cotta and J. M. Troya, Embedding branch and bound within evolutionary algorithms, Applied Intelligence, vol.18, issue.2, pp.137-153, 2003.
DOI : 10.1023/A:1021934325079

A. V. Eremeev, On Complexity of Optimal Recombination for Binary Representations of Solutions, Evolutionary Computation, vol.29, issue.3, pp.127-147, 2008.
DOI : 10.1016/0377-2217(94)00301-7

E. Rothberg, An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions, INFORMS Journal on Computing, vol.19, issue.4, pp.534-541, 2007.
DOI : 10.1287/ijoc.1060.0189

E. Danna, E. Rothberg, and C. L. Pape, Integrating mixed integer programming and local search: A case study on job-shop scheduling problems, in: Fifth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, pp.65-79, 2003.

J. E. Gallardo, C. Cotta, and A. J. Fernández, On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.37, issue.1, pp.77-83, 2007.
DOI : 10.1109/TSMCB.2006.883266

C. Blum, C. Cotta, A. J. Fernández, J. E. Gallardo, and M. M. Blum, Hybridization of metaheuristics with branch & bound derivatives, pp.85-116

P. V. Hentenryck and L. Michel, Constraint-Based Local Search, 2005.

]. L. Shi and S. Olafsson, Nested Partitions Method for Global Optimization, Operations Research, vol.48, issue.3, pp.390-407, 2000.
DOI : 10.1287/opre.48.3.390.12436

S. Al-shihabi and S. Olafsson, A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem, Computers & Operations Research, vol.37, issue.2, pp.247-255, 2010.
DOI : 10.1016/j.cor.2009.04.015

]. L. Shi, S. Olafsson, and Q. Chen, An Optimization Framework for Product Design, Management Science, vol.47, issue.12, pp.1681-1692, 2001.
DOI : 10.1287/mnsc.47.12.1681.10243

M. Boschetti and V. Maniezzo, Benders decomposition, Lagrangean relaxation and metaheuristic design, Journal of Heuristics, vol.21, issue.1, pp.283-312, 2009.
DOI : 10.1007/s10732-007-9064-9

M. Boschetti, V. Maniezzo, and M. R. Maniezzo, Decomposition Techniques as Metaheuristic Frameworks, pp.135-158
DOI : 10.1007/978-1-4419-1306-7_5

J. E. Beasley, Lagrangian relaxation, pp.243-303

V. Jeet and E. Kutanoglu, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, European Journal of Operational Research, vol.182, issue.3, pp.1039-1056, 2007.
DOI : 10.1016/j.ejor.2006.09.060

C. Wilbaut and S. Hanafi, New convergent heuristics for 0???1 mixed integer programming, European Journal of Operational Research, vol.195, issue.1, pp.62-74, 2009.
DOI : 10.1016/j.ejor.2008.01.044

A. L. Soyster, B. Lev, and W. Slivka, Zero-one programming with many variables and few constraints, European Journal of Operational Research, vol.2, issue.3, pp.195-201, 1978.
DOI : 10.1016/0377-2217(78)90093-0

S. Hanafi and C. Wilbaut, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Annals of Operations Research, vol.35, issue.1, pp.125-142, 2011.
DOI : 10.1007/s10479-009-0546-z

F. Glover, Inequalities and Target Objectives for Metaheuristic Search ??? Part I: Mixed Binary Optimization, Advances in Metaheuristics for Hard Optimization, Natural Computing Series, pp.439-474, 2008.
DOI : 10.1007/978-3-540-72960-0_21

G. R. Raidl and H. , An improved hybrid genetic algorithm for the generalized assignment problem, Proceedings of the 2003 ACM Symposium on Applied Computing, pp.990-995, 2004.

P. C. Chu and J. E. 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

M. Vasquez and J. Hao, A hybrid approach for the 0?1 multidimensional knapsack problem, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp.328-333, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00359413

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

M. Haouari and J. C. Siala, A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem, Computers & Operations Research, vol.33, issue.5, pp.1274-1288, 2006.
DOI : 10.1016/j.cor.2004.09.017

F. Barahona and R. , The volume algorithm: producing primal solutions with a subgradient method, Mathematical Programming, vol.87, issue.3, pp.385-399, 2000.
DOI : 10.1007/s101070050002

S. Pirkwieser, G. R. Raidl, and J. Puchinger, Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem, Lecture Notes in Computer Science, vol.4446, pp.176-187, 2007.
DOI : 10.1007/978-3-540-71615-0_16
URL : https://hal.archives-ouvertes.fr/hal-01299751

M. Leitner and G. R. Aguilera, Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks, pp.158-174
DOI : 10.1007/11890584_1

H. Tamura, A. Hirahara, I. Hatono, and M. Umano, An approximate solution method for combinatorial optimisation, Transactions of the Society of Instrument and Control Engineers, vol.130, pp.329-336, 1994.

M. Reimann, Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP, Proceedings of HM 2007 ? Fourth International Workshop on Hybrid Metaheuristics, pp.45-55, 2007.
DOI : 10.1007/978-3-540-75514-2_4

D. P. Bertsekas, Dynamic Programming and Optimal Control, Athena Scientific, 2007.

R. K. Congram, C. N. Potts, and S. L. Van-de-velde, An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem, INFORMS Journal on Computing, vol.14, issue.1, pp.52-67, 2002.
DOI : 10.1287/ijoc.14.1.52.7712

A. Grosso, F. Della-croce, and R. Tadei, An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem, Operations Research Letters, vol.32, issue.1, pp.68-72, 2004.
DOI : 10.1016/S0167-6377(03)00064-6

E. Angel and E. Bampis, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, European Journal of Operational Research, vol.162, issue.1, pp.281-289, 2005.
DOI : 10.1016/j.ejor.2003.08.061
URL : https://hal.archives-ouvertes.fr/hal-00341340

M. Sniedovich and S. Voß, The Corridor Method, Control and Cybernetics, vol.35, issue.3, pp.551-578, 2006.
DOI : 10.1201/EBK0824740993-26

M. Heidari, T. Chow, and P. V. Kokotovic, Discrete Differential Dynamic Programing Approach to Water Resources Systems Optimization, Water Resources Research, vol.16, issue.1, pp.273-282, 1971.
DOI : 10.1029/WR007i002p00273

R. K. Ahuja, ¨. O. Ergun, J. B. Orlin, and A. P. Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.1-3, 2002.
DOI : 10.1016/S0166-218X(01)00338-9

M. Caserta, S. Voß, and M. Sniedovich, Applying the corridor method to a blocks relocation problem, OR Spectrum, vol.17, issue.4
DOI : 10.1007/s00291-009-0176-5

M. Caserta and S. Voß, A Math-Heuristic Algorithm for the DNA Sequencing Problem, Proceedings of LION 2010 ? 4th International Conference on Learning and Intelligent Optimization, pp.25-36, 2010.
DOI : 10.1007/978-3-642-13800-3_3

M. Caserta and S. Voß, A Corridor Method-Based Algorithm for the Pre-marshalling Problem, Proceedings of the EvoWorkshops 2009 ? Applications of Evolutionary Computing, pp.788-797, 2009.
DOI : 10.1007/978-3-642-01129-0_89

C. Blum and M. J. Blesa, Solving the KCT Problem: Large-Scale Neighborhood Search and Solution Merging, Optimization Techniques for Solving Complex Problems, pp.407-421, 2009.
DOI : 10.1002/9780470411353.ch23

B. Hu and G. R. , Effective Neighborhood Structures for the Generalized Traveling Salesman Problem, Evolutionary Computation in Combinatorial Optimisation ? EvoCOP, pp.36-47, 2008.
DOI : 10.1007/978-3-540-78604-7_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.7108

T. Dunker, G. Radons, and E. Westkämper, Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem, European Journal of Operational Research, vol.165, issue.1, pp.55-69, 2005.
DOI : 10.1016/j.ejor.2003.01.002

J. Balakrishnan, C. H. Cheng, D. G. Conway, and C. M. Lau, A hybrid genetic algorithm for the dynamic plant layout problem, International Journal of Production Economics, vol.86, issue.2, pp.107-120, 2003.
DOI : 10.1016/S0925-5273(03)00027-6

C. Wilbaut, S. Hanafi, A. Fréville, and S. Balev, Tabu search: global intensification using dynamic programming, Control and Cybernetics, vol.35, issue.3, pp.579-598, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00445799

S. Tse, Y. Liang, K. Leung, K. Lee, and T. S. Mok, A Memetic Algorithm for Multiple-Drug Cancer Chemotherapy Schedule Optimization, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.37, issue.1, pp.84-91, 2007.
DOI : 10.1109/TSMCB.2006.883265

W. Juang and S. Su, Multiple sequence alignment using modified dynamic programming and particle swarm optimization, Journal of the Chinese Institute of Engineers, vol.13, issue.4, pp.659-673, 2008.
DOI : 10.1109/3477.650054

J. Bautista and J. Pereira, A dynamic programming based heuristic for the assembly line balancing problem, European Journal of Operational Research, vol.194, issue.3, pp.787-794, 2009.
DOI : 10.1016/j.ejor.2008.01.016

S. Imahori, M. Yagiura, and T. Ibaraki, Improved local search algorithms for the rectangle packing problem with general spatial costs, European Journal of Operational Research, vol.167, issue.1, pp.48-67, 2005.
DOI : 10.1016/j.ejor.2004.02.020

J. N. Hooker, Testing heuristics: We have it all wrong, Journal of Heuristics, vol.6, issue.1
DOI : 10.1007/BF02430364
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4103

C. C. Mcgeoch, Experimental Analysis of Algorithms, Notices of the American Mathematical Society, vol.48, issue.3, pp.304-311, 2001.
DOI : 10.1007/978-1-4757-5362-2_14

P. R. Cohen, Empirical methods for Artificial Intelligence, 1995.

D. S. Johnson, A theoretician's guide to the experimental analysis of algorithms Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, pp.215-250, 2002.

M. Birattari, Tuning Metaheuristics: A machine learning perspective, of Studies in Computational Intelligence, 2009.
DOI : 10.1007/978-3-642-00483-4

C. C. Mcgeoch, Feature Article???Toward an Experimental Method for Algorithm Simulation, INFORMS Journal on Computing, vol.8, issue.1, pp.1-15, 1996.
DOI : 10.1287/ijoc.8.1.1