R. Acuna-agost, M. Boudia, S. Gabteni, N. Jozefowiez, C. Mancel et al., Méthodes de recherche opérationnelle pour la gestion des perturbations dans le domaine aérien, 2010.

A. E. Akay, Minimizing total costs of forest roads with computer-aided design model, Proceedings of the 1997 Winter Simulation Conference, pp.621-633, 2006.
DOI : 10.1007/BF02715918

A. Alshibani, Optimizing and Controlling Earthmoving Operations Using Spatial Technologies, pp.259-45646, 2008.

C. Archetti and M. Savelsbergh, The truckload trip scheduling problem. TRISTAN VI, the 6th Triennial Symposium on Transportation Analysis, 2007.

W. H. Askew, S. H. Al-jibouri, M. J. Mawdesley, and D. E. Patterson, Planning linear construction projects: automated method for the generation of earthwork activities, Automation in Construction, vol.11, issue.6, pp.643-653, 2002.
DOI : 10.1016/S0926-5805(02)00005-5

J. F. Bard, F. Huang, M. Dror, and P. Jaillet, A branch and cut algorithm for the VRP with satellite facilities, IIE Transactions, vol.26, issue.9, pp.831-834, 1998.
DOI : 10.1137/0405004

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316

W. Bell, L. Dalberto, M. Fisher, A. Greeneld, R. Jaikumar et al., Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer, Interfaces, vol.13, issue.6, pp.4-23, 1983.
DOI : 10.1287/inte.13.6.4

J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

T. Benoist, B. Estellon, F. Gardi, and A. Jeanjean, Recherche locale pour un problème d'optimisation de tournées de véhicules avec gestion des stocks, MOSIM 2010, p.145, 2010.

T. Benoist, B. Estellon, F. Gardi, and A. Jeanjean, High-Performance Local Search for Solving Real-Life Inventory Routing Problems, 2009.
DOI : 10.1287/trsc.1030.0046

T. Benoist, A. Jeanjean, G. Rochart, H. Cambazard, E. Grellier et al., Subcontractors scheduling on residential buildings construction sites, ISS 2006, the 3rd International Scheduling Symposium (sous la direction de T. Ibaraki), pp.32-37, 2006.
DOI : 10.1007/s10288-008-0092-6
URL : https://hal.archives-ouvertes.fr/hal-00869099

T. Benoist, A. Jeanjean, and P. Molin, Aectation du matériel de corage sur des chantiers de construction, Roadef'07, 2007.

T. Benoist, Towards optimal formwork pairing on construction sites, RAIRO - Operations Research, vol.41, issue.4, pp.381-398, 2007.
DOI : 10.1051/ro:2007035

T. Benoist and A. Jeanjean, Etude du comportement d'annulation d'une contreproposition d'un spot publicitaire, Roadef'08, 2008.

T. Benoist, A. Jeanjean, and P. Molin, Minimum Formwork Stock problem on residential buildings construction sites, 4OR, vol.3, issue.3, 2008.
DOI : 10.1007/s10288-008-0092-6

T. Benoist, B. Estellon, F. Gardi, and A. Jeanjean, High-Performance Local Search for Solving Real-Life Inventory Routing Problems, SLS 2009, the 2nd International Workshop on Engineering Stochastic Local Search Algorithms, p.105109, 2009.
DOI : 10.1287/trsc.1030.0046

T. Benoist, B. Estellon, F. Gardi, and A. Jeanjean, Recherche locale haute performance pour l'optimisation des livraisons de gaz industriels par camion-citerne, Actes de ROADEF 2009, le 10ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, 2009.

T. Benoist, B. Estellon, F. Gardi, and A. Jeanjean, Stochastic local search for real-life inventory routing, Transportation Sciences, 2010.
DOI : 10.1287/trsc.1100.0360

T. Benoist, B. Estellon, F. Gardi, and A. Jeanjean, Recherche locale pour un problème d'optimisation de tournées de véhicules avec gestion des stocks, MOSIM 2010, 2010.

T. Benoist, B. Estellon, F. Gardi, S. Jain, A. Jeanjean et al., Inventory routing optimization for bulk gas transportation, INFORMS 2009 , Annual Meeting, 2010.

T. Benoist, F. Gardi, and A. Jeanjean, Lessons Learned from 15 Years of Operations Research for French TV Channel TF1, Interfaces, vol.42, issue.6, 2011.
DOI : 10.1287/inte.1110.0623

T. Benoist, A. Jeanjean, and V. Jost, Le problème du voyageur de commerce unidimensionnel avec précédences, Roadef'2011, 2011.

A. Brunner, Zürich Airport Extension Project : Digital Support for Earthwork Construction Springer-Verlag, DEM 2001, LNCS 2181, p.1, 2001.

A. Campbell, L. Clarke, A. Kleywegt, and M. Savelsbergh, The inventory routing problem . Fleet Management and Logistics, pp.95-113, 1998.

A. Campbell, L. Clarke, and M. Savelsbergh, Inventory routing in practice The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, vol.9, p.309330, 2002.

A. Campbell and M. Savelsbergh, A Decomposition Approach for the Inventory-Routing Problem, Transportation Science, vol.38, issue.4, pp.488-502, 2004.
DOI : 10.1287/trsc.1030.0054

A. Campbell and M. Savelsbergh, Delivery Volume Optimization, Transportation Science, vol.38, issue.2, pp.210-223, 2004.
DOI : 10.1287/trsc.1030.0042

A. Campbell and M. Savelsbergh, Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems, Transportation Science, vol.38, issue.3, pp.369-378, 2004.
DOI : 10.1287/trsc.1030.0046

T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction à l'Algorithmique. Dunod, 2004.

F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, Heuristique pour le problème d'approvisionnement des stations d'essence sur plusieurs périodes, 2006.

G. B. Dantzig, Application of the simplex method to a transportation problem In Activity Analysis of Production and Allocation, Conference on Linear Programming, 1949.

G. B. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960.
DOI : 10.1287/opre.8.1.101

M. G. De-la-banda and P. J. Stuckey, Dynamic Programming to Minimize the Maximum Number of Open Stacks, INFORMS Journal on Computing, vol.19, issue.4, pp.607-617, 2007.
DOI : 10.1287/ijoc.1060.0205

M. Desrochers and F. M. Solomon, A Column Generation Approach to the Urban Transit Crew Scheduling Problem, Transportation Science, vol.23, issue.1, pp.1-13, 1989.
DOI : 10.1287/trsc.23.1.1

M. Dorigo, Optimization, Learning and Natural Algorithms, 1992.

M. Dror, Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW, Operations Research, vol.42, issue.5, pp.977-978, 1994.
DOI : 10.1287/opre.42.5.977

S. M. Easa, Earthwork Allocations with Linear Unit Costs, Journal of Construction Engineering and Management, vol.114, issue.4, pp.641-655, 1988.
DOI : 10.1061/(ASCE)0733-9364(1988)114:4(641)

S. M. Ervin, Designed Landforms, Digital Earth Moving Lecture Notes in Computer Science, vol.2181, issue.2, 2001.
DOI : 10.1007/3-540-44818-7_2

B. Estellon, F. Gardi, and K. Nouioua, Large neighborhood improvements for solving car sequencing problems, RAIRO - Operations Research, vol.40, issue.4, pp.355-379, 2006.
DOI : 10.1051/ro:2007003

B. Estellon, F. Gardi, and K. Nouioua, Two local search approaches for solving real-life car sequencing problems, European Journal of Operational Research, vol.191, issue.3, pp.928-944, 2006.
DOI : 10.1016/j.ejor.2007.04.043

B. Estellon, F. Gardi, and K. Nouioua, High-Performance Local Search for Task Scheduling with Human Resource Allocation, SLS 2009, the 2nd International Workshop on Engineering Stochastic Local Search Algorithms, pp.1-15, 2009.
DOI : 10.1007/978-3-540-24605-3_22

D. Feillet, A tutorial on column generation and brand-and-price for vehicule routing problems, 2010.

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

V. Gabrel, A. Knippel, and M. Minoux, Exact solution of multicommodity network optimization problems with general step cost functions, Operations Research Letters, vol.25, issue.1, pp.15-23, 1999.
DOI : 10.1016/S0167-6377(99)00020-6
URL : https://hal.archives-ouvertes.fr/hal-01150534

F. Gardi and K. Nouioua, Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application, Proceedings of EvoCOP 2011, the 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, pp.167-178, 2011.
DOI : 10.1007/978-3-642-20364-0_15

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplied NP-complete problems, Proceedings of the sixth annual ACM symposium on Theory of computing, pp.47-63, 1974.

M. Gendreau, An Introduction to Tabu Search, pp.37-54, 2003.
DOI : 10.1007/0-306-48056-5_2

A. M. Georion, Lagrangean relaxation for integer programming, Math. Programming Stud, vol.2, pp.82-114, 1974.
DOI : 10.1007/BFb0120690

S. Godskesen, T. Sejr, J. N. Kjeldsen, and R. Larsen, Solving a real-life, large-scale energy management problem, Journal of Scheduling, vol.7, issue.2, 2010.
DOI : 10.1007/s10951-012-0279-8

D. E. Goldberg, Genetic Algorithms in Search. Optimization and Machine Learning, 1989.

T. F. Gonzalès, Handbook of Approximation Algorithms and Metaheuristics, 2007.
DOI : 10.1201/9781420010749

C. Guéret, C. Prins, and M. Sevaux, Programmation linéaire -65 problèmes d'optimisation modélisés et résolus avec Visual Xpress, 2000.

P. Hansen and N. Mladenovic, First vs. best improvement: An empirical study, Special issue : IV ALIO/EURO, 2006.
DOI : 10.1016/j.dam.2005.05.020

M. Held and R. M. Karp, A dynamic programming approach to sequencing problems, Proceedings of the 16th ACM national meeting, pp.71-201, 1961.

K. Helsgaun, An effective implementation of the Lin???Kernighan traveling salesman heuristic, European Journal of Operational Research, vol.126, issue.1, pp.106-130, 2000.
DOI : 10.1016/S0377-2217(99)00284-2

D. Hendersona, D. Vaughanb, S. Jacobson, R. Wakeeldd, and E. Sewelle, Solving the shortest route cut and fill problem using simulated annealing, European Journal of Operational Research, vol.145, issue.1, pp.72-84, 2003.
DOI : 10.1016/S0377-2217(02)00206-0

A. Jeanjean, Optimizing Transportation Decisions in a Manufacturing Supply Chain, 2004.

A. Jeanjean and B. Martin, Optimisation de placement de publicité internet par l'algorithme des bandits manchots, Roadef'09, 2009.

A. Jeanjean, Optimisation de mouvements de terre sur des chantiers linéaires de terrassement, Digiteo Optimeo, 2009.

A. Jeanjean and T. Hanin, Analyse et Classication d'évènements d'actualité pour l'amélioration de méthodes de prévision, 2010.

A. Jeanjean, Resource scheduling optimization in mass transportation problems, PMS 2010, 2010.

A. Jeanjean, Optimisation de mouvements de terre sur des chantiers linéaires de terrassement, Roadef'2010, 2010.

A. Jeanjean and B. Martin, Prévisions d'audiences et optimisation de plannings de publicités internet, Roadef'2010, 2010.

A. Jeanjean and J. Masson, Optimisation des prix et prévisions des fréquentations des hôtels du Groupe Louvre Hôtels, Roadef'2011, 2011.

E. L. Johnson, Modeling and strong linear programs for mixed integer programming . Algorithms and Model Formulations in Mathematical Programming, pp.1-43, 1989.

L. V. Kantorovich, On a Problem of Monge, Journal of Mathematical Sciences, vol.133, issue.4, pp.225-226, 1948.
DOI : 10.1007/s10958-006-0050-9

G. Kannan, J. C. Martinez, M. C. Vorster, and B. L. Nelson, A framework for incorporating dynamic strategies in earth-moving simulations, Proceedings of the 29th conference on Winter simulation , WSC '97, 1997.
DOI : 10.1145/268437.268748

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

S. Kataria, S. A. Samdani, and A. K. Singh, Ant Colony Optimization in Earthwork Allocation, International Conference on Intelligent Systems, 2005.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

J. R. Koza, Non-Linear Genetic Algorithms for Solving Problems, 1990.

F. Laburthe, Choco : implementing a cp kernel, Proceedings of TRICS, 2000.

V. and L. Diagon, Optimisation des grands arrêts de ranerie, 2009.

C. , L. Pape, and P. Baptiste, Optimisation du stock de banches sur des chantiers de construction, 1999.

S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.
DOI : 10.1287/opre.21.2.498

V. Lübbecke, Column Generation, Wiley Encyclopedia of Operations Research and Management Science (EORMS), 2010.
DOI : 10.1002/9780470400531.eorms0158

D. Maier, The Complexity of Some Problems on Subsequences and Supersequences, Journal of the ACM, vol.25, issue.2, pp.322-336, 1978.
DOI : 10.1145/322063.322075

B. Martin and A. Jeanjean, Outils de simulation pour gestion de parc d'équipements, Roadef'07, 2007.

M. Marzouk and O. Moselhi, CEPM 1 : selecting earthmoving equipment eets using genetic algorithms, Proceedings of the 34th Winter Simulation Conference, pp.1789-1796, 2002.

M. Marzouk and O. Moselhi, Multiobjective Optimization of Earthmoving Operations, Journal of Construction Engineering and Management, vol.130, issue.1, pp.105-113, 2004.
DOI : 10.1061/(ASCE)0733-9364(2004)130:1(105)

R. Mayer and R. Stark, Earthmoving logistics, Journal of the Construction Division, vol.107, issue.2, pp.297-312, 1981.

M. Minoux, Networks synthesis and optimum network design problems: Models, solution methods and applications, Networks, vol.14, issue.3, pp.313-360, 1989.
DOI : 10.1002/net.3230190305

M. Minoux, Discrete cost multicommodity network optimization problems and exact solution methods, Annals of Operations Research, vol.106, issue.1/4, pp.19-46, 2001.
DOI : 10.1023/A:1014554606793
URL : https://hal.archives-ouvertes.fr/hal-01149564

M. Minoux, Optimum Network Design Models and Algorithms in Transportation and Communication, International Journal of Logistics Research and Applications, vol.6, issue.1, pp.5-15, 2003.
DOI : 10.1080/1367556031000063022
URL : https://hal.archives-ouvertes.fr/hal-01149323

G. Monge, Mémoire sur la théorie des déblais et des remblais, Histoire de l'Academie Royale des Sciences, 1781.

A. A. Moreb, Linear programming model for finding optimal roadway grades that minimize earthwork cost, European Journal of Operational Research, vol.93, issue.1, pp.148-154, 1996.
DOI : 10.1016/0377-2217(95)00095-X

B. M. Moret, Towards a discipline of experimental algorithmics In Data Structures, Near Neighbor Searches, and Methodology : 5th and 6th DIMACS Implementation Challenges, DIMACS Monographs, vol.59, pp.197-213, 2002.

O. Moselhi and A. Alshibani, Optimization of Earthmoving Operations in Heavy Civil Engineering Projects, Journal of Construction Engineering and Management, vol.135, issue.10, pp.948-954, 2009.
DOI : 10.1061/(ASCE)0733-9364(2009)135:10(948)

F. Noonan and R. J. Giglio, Planning Electric Power Generation: A Nonlinear Mixed Integer Model Employing Benders Decomposition, Management Science, vol.23, issue.9, pp.946-956, 1977.
DOI : 10.1287/mnsc.23.9.946

M. Porcheron, A. Gorge, O. Juan, T. Simovic, and G. Dereu, ROADEF/EURO 2010 : a large-scale energy management problem with varied constraints EDF R&D, p.27, 2010.

K. J. Räihä and E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete Theoretical, Computer Science, vol.16, issue.2, pp.187-198, 1981.

K. Rana and R. G. Vickson, Routing Container Ships Using Lagrangean Relaxation and Decomposition, Transportation Science, vol.25, issue.3, pp.201-214, 1991.
DOI : 10.1287/trsc.25.3.201

M. Savelsbergh, A Branch-and-Price Algorithm for the Generalized Assignment Problem, Operations Research, vol.45, issue.6, pp.831-841, 1997.
DOI : 10.1287/opre.45.6.831

M. Savelsbergh and J. Song, Inventory routing with continuous moves, Computers & Operations Research, vol.34, issue.6, pp.1744-1763, 2007.
DOI : 10.1016/j.cor.2005.05.036

M. Savelsbergh and J. Song, An optimization algorithm for the inventory routing problem with continuous moves, Computers & Operations Research, vol.35, issue.7, pp.2266-2282, 2008.
DOI : 10.1016/j.cor.2006.10.020

A. Schrijver, Combinatorial Optimization -Polyhedra and Eciency, 2003.

M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.
DOI : 10.1287/opre.35.2.254

E. G. Talbi, From Design to Implementation, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00750681

J. D. Ullman, Complexity of sequencing problems, 1976.