T. Achterberg and T. Berthold, Improving the feasibility pump, Discrete Optimization, vol.4, issue.1, pp.77-86, 2007.
DOI : 10.1016/j.disopt.2006.10.004

Y. Agarwal, K. Mathur, and H. M. Salkin, A set-partitioning-based exact algorithm for the vehicle routing problem, Networks, vol.19, issue.7, pp.731-749, 1989.
DOI : 10.1002/net.3230190702

G. Belov and G. Scheithauer, A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths, European Journal of Operational Research, vol.141, issue.2, pp.274-294, 2002.
DOI : 10.1016/S0377-2217(02)00125-X

L. Bertacco, M. Fischetti, and A. Lodi, A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization, pp.63-76, 2007.

T. Berthold, Primal Heuristics for Mixed Integer Programs, 2006.

B. Bixby, Presentation of the gurobi optimizer. Integer Programming Down Under: Theory, Algorithms and Applications, 2011.

A. Ceselli, G. Righini, and M. Salani, A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints, Proceedings TRISTAN, 2007.

A. Chabrier, Heuristic branch-and-price-and-cut to solve a network design problem, In Proceedings CPAIOR, 2003.

A. Chabrier, E. Danna, and C. L. Pape, Coopération entre génération de colonnes et recherche locale appliquées auprobì eme de routage de véhicules, InHuitì emes Journées Nationales sur la résolution deProbì emes NP-Complets (JNPC), pp.83-97, 2002.

G. Dobson, Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data, Mathematics of Operations Research, vol.7, issue.4, pp.515-531, 1982.
DOI : 10.1287/moor.7.4.515

M. Fischetti, F. Glover, and A. Lodi, The feasibility pump, Mathematical Programming, vol.106, issue.1, pp.91-104, 2005.
DOI : 10.1007/s10107-004-0570-3

M. Fischetti and D. Salvagnin, Feasibility pump 2.0, Mathematical Programming Computation, vol.6, issue.1???3, pp.201-222, 2009.
DOI : 10.1007/s12532-009-0007-3

C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, and F. Vanderbeck, Column Generation based Primal Heuristics, Electronic Notes in Discrete Mathematics, vol.36, pp.695-702, 2010.
DOI : 10.1016/j.endm.2010.05.088
URL : https://hal.archives-ouvertes.fr/hal-00790610

N. Perrot, Integer Programming Column Generation Strategies for the Cutting Stock Problem and its Variants, 2005.
URL : https://hal.archives-ouvertes.fr/tel-00011657

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

D. Pisinger, A Minimal Algorithm for the Bounded Knapsack Problem, INFORMS Journal on Computing, vol.12, issue.1, pp.75-82, 2000.
DOI : 10.1287/ijoc.12.1.75.11898

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

V. Schmid, K. F. Doerner, R. F. Hartl, M. W. Savelsbergh, W. Stoecher et al., An effective heuristic for ready mixed concrete delivery A heuristic column generation method for the heterogeneous fleet VRP, Proceedings TRISTAN, pp.1-14, 1999.

F. Vanderbeck and M. W. Savelsbergh, A generic view of Dantzig???Wolfe decomposition in mixed integer programming, Operations Research Letters, vol.34, issue.3, pp.296-306, 2006.
DOI : 10.1016/j.orl.2005.05.009
URL : https://hal.archives-ouvertes.fr/inria-00342623

F. Vanderbeck and L. Wolsey, Reformulation and Decomposition of Integer Programs, 50 Years of Integer Programming, pp.431-502, 1958.
DOI : 10.1007/978-3-540-68279-0_13
URL : https://hal.archives-ouvertes.fr/inria-00392254