Improving the feasibility pump, Discrete Optimization, vol.4, issue.1, pp.77-86, 2007. ,
DOI : 10.1016/j.disopt.2006.10.004
URL : http://doi.org/10.1016/j.disopt.2006.10.004
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
A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.1-375, 2002. ,
DOI : 10.1016/S0166-218X(01)00338-9
A branch-and-price-and-cut approach for sustainable crop rotation planning, European Journal of Operational Research, vol.241, issue.3, pp.872-879, 2015. ,
DOI : 10.1016/j.ejor.2014.09.066
URL : https://hal.archives-ouvertes.fr/emse-01225167
Optimal interval scheduling with a resource constraint, Computers & Operations Research, vol.51, pp.268-281, 2014. ,
DOI : 10.1016/j.cor.2014.06.002
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
A feasibility pump heuristic for general mixed-integer problems, Discrete Optimization, vol.4, issue.1, pp.63-76, 2007. ,
DOI : 10.1016/j.disopt.2006.10.001
Primal Heuristics for Mixed Integer Programs, 2006. ,
The distance constrained multiple vehicle traveling purchaser problem, European Journal of Operational Research, vol.235, issue.1, pp.73-87, 2014. ,
DOI : 10.1016/j.ejor.2013.10.018
Presentation of the Gurobi Optimizer. Integer Programming Down Under: Theory, Algorithms and Applications, 2011. ,
A set-covering based heuristic algorithm for the periodic vehicle routing problem, Discrete Applied Mathematics, vol.163, issue.1, pp.53-64, 2014. ,
DOI : 10.1016/j.dam.2012.08.032
A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints, Proceedings TRISTAN, 2007. ,
Coopération entre génération de colonnes et recherche locale appliquées au problème de routage de véhicules, Huitièmes Journées Nationales sur la résolution de Problèmes NP-Complets (JNPC), pp.83-97, 2002. ,
Solving a Network Design Problem, Annals of Operations Research, vol.130, issue.1-4, pp.217-239, 2004. ,
DOI : 10.1023/B:ANOR.0000032577.81139.84
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, European Journal of Operational Research, vol.191, issue.1, pp.61-85, 2008. ,
DOI : 10.1016/j.ejor.2007.08.007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.4835
Column-generation based bounds for the Homogeneous Areas Problem, European Journal of Operational Research, vol.236, issue.2, pp.695-705, 2014. ,
DOI : 10.1016/j.ejor.2013.12.030
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
Fragment-based planning using column generation, 24th International Conference on Automated Planning and Scheduling, 2014. ,
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times, Operations Research, vol.55, issue.5, pp.909-920, 2007. ,
DOI : 10.1287/opre.1070.0404
Bin packing and cutting stock problems: Mathematical models and exact algorithms. Research report OR-15-1, DEI " Guglielmo Marconi, 2015. ,
DOI : 10.1016/j.ejor.2016.04.030
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
The feasibility pump, Mathematical Programming, pp.91-104, 2005. ,
DOI : 10.1007/s10107-004-0570-3
Feasibility pump 2.0, Mathematical Programming Computation, vol.6, issue.1???3, pp.201-222, 2009. ,
DOI : 10.1007/s12532-009-0007-3
Recent Advances in Graph Vertex Coloring, Handbook of Optimization, pp.505-528, 2013. ,
DOI : 10.1007/978-3-642-30504-7_20
A Column Generation Approach for Large-Scale Aircrew Rostering Problems, Operations Research, vol.47, issue.2, pp.247-263, 1999. ,
DOI : 10.1287/opre.47.2.247
Duty Scheduling in Public Transit, Mathematics ? Key Technology for the Future, pp.653-674, 2003. ,
DOI : 10.1007/978-3-642-55753-8_50
Vehicle Routing and Staffing for Sedan Service, Transportation Science, vol.40, issue.3, pp.313-326, 2006. ,
DOI : 10.1287/trsc.1050.0122
Limited discrepancy search, Proc. IJCAI-95, pp.607-613, 1995. ,
Maximum-weight stable sets and safe lower bounds for graph coloring, Mathematical Programming Computation, vol.3, issue.1, pp.363-381, 2012. ,
DOI : 10.1007/s12532-012-0042-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.1273
Recursive Computational Procedure for Two-dimensional Stock Cutting, IBM Journal of Research and Development, vol.16, issue.5, pp.462-469, 1972. ,
DOI : 10.1147/rd.165.0462
Column Generation based Primal Heuristics, International Symposium on Combinatorial Optimization, pp.695-702, 2010. ,
DOI : 10.1016/j.endm.2010.05.088
URL : https://hal.archives-ouvertes.fr/hal-00790610
An exact algorithm for parallel machine scheduling with conflicts, Journal of Scheduling, vol.66, issue.2, 2015. ,
DOI : 10.1007/s10951-016-0482-0
URL : https://lirias.kuleuven.be/bitstream/123456789/485437/1/KBI_1505.pdf
A column generation approach for power-aware optimization of virtualized heterogeneous server clusters, Computers and Industrial Engineering, vol.63, issue.3, pp.652-662, 2012. ,
A Computational Study of Search Strategies for Mixed Integer Programming, INFORMS Journal on Computing, vol.11, issue.2, pp.173-187, 1999. ,
DOI : 10.1287/ijoc.11.2.173
Primal Heuristics for Branch-and-Price Algorithms, Operations Research Proceedings 2011, Operations Research Proceedings, pp.65-70, 2012. ,
DOI : 10.1007/978-3-642-29210-1_11
A Column-Generation Based Tactical Planning Method for Inventory Routing, Operations Research, vol.60, issue.2, pp.382-397, 2012. ,
DOI : 10.1287/opre.1110.1015
URL : https://hal.archives-ouvertes.fr/inria-00169311
A New Algorithm for the Maximum-Weight Clique Problem, Electronic Notes in Discrete Mathematics, vol.3, pp.424-436, 2001. ,
DOI : 10.1016/S1571-0653(05)00757-2
Integer Programming Column Generation Strategies for the Cutting Stock Problem and its Variants, 2005. ,
URL : https://hal.archives-ouvertes.fr/tel-00011657
Feasibility Pump Heuristics for Column Generation Approaches, Experimental Algorithms, pp.332-343, 2012. ,
DOI : 10.1007/978-3-642-30850-5_29
URL : https://hal.archives-ouvertes.fr/hal-00686255
Automation and combination of linear-programming based stabilization techniques in column generation, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01077984
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
An exact method with variable fixing for solving the generalized assignment problem, Computational Optimization and Applications, vol.169, issue.2, pp.629-644, 2012. ,
DOI : 10.1007/s10589-011-9432-0
URL : https://hal.archives-ouvertes.fr/hal-01320026
Column generation-based heuristics for vehicle routing problem with soft time windows, Journal of the Eastern Asia Society for Transportation Studies, vol.8, pp.827-841, 2010. ,
The prominence of stabilization techniques in column generation: the case of freight transportation, Sixth International Workshop on Freight Transportation and Logistics, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01248323
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm, INFORMS Journal on Computing, vol.25, issue.2, pp.244-255, 2013. ,
DOI : 10.1287/ijoc.1120.0499
URL : https://hal.archives-ouvertes.fr/inria-00539869
Column generation based heuristic for the generalized assignment problem, XLVII Simpósio Brasileiro de Pesquisa Operacional, 2015. ,
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery, Transportation Science, vol.43, issue.1, pp.70-85, 2009. ,
DOI : 10.1287/trsc.1080.0249
The discrete time window assignment vehicle routing problem, European Journal of Operational Research, vol.244, issue.2, pp.379-391, 2015. ,
DOI : 10.1016/j.ejor.2015.01.020
A heuristic column generation method for the heterogeneous fleet VRP, RAIRO - Operations Research, vol.33, issue.1, pp.1-14, 1999. ,
DOI : 10.1051/ro:1999101
Quantum annealing of the graph coloring problem, Discrete Optimization, vol.8, issue.2, pp.376-384, 2011. ,
DOI : 10.1016/j.disopt.2010.12.001
chapter Implementing Mixed Integer Column Generation Kluwer's series in Operations Research, pp.331-358, 2005. ,
DOI : 10.1007/0-387-25486-2_12
Branching in branch-and-price: a generic scheme, Mathematical Programming, pp.249-294, 2011. ,
DOI : 10.1007/s10107-009-0334-1
URL : https://hal.archives-ouvertes.fr/inria-00311274
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
Reformulation and Decomposition of Integer Programs, 50 Years of Integer Programming, 1958. ,
DOI : 10.1007/978-3-540-68279-0_13
URL : https://hal.archives-ouvertes.fr/inria-00392254
A path relinking approach with ejection chains for the generalized assignment problem, European Journal of Operational Research, vol.169, issue.2, pp.548-569, 2006. ,
DOI : 10.1016/j.ejor.2004.08.015