O. Bastert, B. Hummel, and S. De-vries, A generalized Wedelin heuristic for integer programming, INFORMS Journal on Computing, vol.22, issue.1, pp.93-107, 2010.

T. Benoist, . Estellon, . Gardi, K. Megel, and . Nouioua, Localsolver 1. x: a black-box local-search solver for 0-1 programming, vol.4, pp.299-316, 2011.

R. Borndörfer, M. Grötschel, F. Klostermeier, and C. Küttner, Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System, 1999.

M. L. Fisher, The Lagrangian relaxation method for solving integer programming problems. Management science, vol.50, pp.1861-1871, 2004.

B. Iooss and P. Lemaître, A review on global sensitivity analysis methods, Uncertainty Manag. in Simul.-Optim. of Complex Systems, pp.101-122, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00975701

S. Maqrot, G. De-givry, M. Quesnel, and . Tchamitchian, A Mixed Integer Programming Reformulation of the Mixed Fruit-Vegetable Crop Allocation Problem, Advances in Artificial Intelligence: From Theory to Practice, pp.237-250, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01605661

R. Walter, J. S. Mebane, and . Sekhon, Genetic optimization using derivatives: the rgenoud package for R, Journal of Statistical Software, vol.42, issue.11, pp.1-26, 2011.

M. D. Morris, Factorial sampling plans for preliminary computational experiments, Technometrics, vol.33, issue.2, pp.161-174, 1991.

S. Umetani, Exploiting variable associations to configure efficient local search algorithms in largescale binary integer programs, vol.263, pp.72-81, 2017.

D. Wedelin, An algorithm for large scale 0/1 integer programming with application to airline crew scheduling, Annals of operations research, vol.57, issue.1, pp.283-301, 1995.