T. Achterberg, Conflict analysis in mixed integer programming, Discrete Optimization, vol.4, issue.1, pp.4-20, 2007.

C. Archetti, E. Fernández, and D. L. Huerta-muñoz, The Flexible Periodic Vehicle Routing Problem, Computers & Operations Research, vol.85, pp.58-70, 2017.

C. Artigues, On the strength of time-indexed formulations for the resource-constrained project scheduling problem, Operations Research Letters, vol.45, issue.2, pp.154-159, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01461447

M. Bartusch, R. H. Möhring, and F. J. Radermacher, Scheduling project networks with resource constraints and time windows, Annals of Operations Research, vol.16, issue.1, pp.199-240, 1988.

A. Bettinelli, V. Cacchiani, and E. Malaguti, A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph, INFORMS Journal on Computing, vol.29, issue.3, pp.457-473, 2017.

A. M. Campbell and J. H. Wilson, Forty years of periodic vehicle routing, Networks, vol.63, issue.1, pp.2-15, 2013.

N. Christofides, R. Alvarez-valdes, and J. M. Tamarit, Project scheduling with resource constraints: A branch and bound approach, European Journal of Operational Research, vol.29, issue.3, pp.262-273, 1987.

S. Coniglio, F. Furini, and P. San-segundo, A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts, European Journal of Operational Research, p.2020, 2020.

M. Dell'amico, J. C. Díaz, and M. Iori, The Bin Packing Problem with Precedence Constraints, Operations Research, vol.60, issue.6, pp.1491-1504, 2012.

M. Delorme and M. Iori, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, INFORMS Journal on Computing, vol.32, issue.1, pp.101-119, 2020.

M. Delorme, M. Iori, and S. Martello, Bin packing and cutting stock problems: Mathematical models and exact algorithms, European Journal of Operational Research, vol.255, issue.1, pp.1-20, 2016.

S. Elhedhli, L. Li, M. Gzara, and J. Naoum-sawaya, A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts, INFORMS Journal on Computing, vol.23, issue.3, pp.404-415, 2011.

A. E. Fernandes-muritiba, M. Iori, E. Malaguti, and P. Toth, Algorithms for the Bin Packing Problem with Conflicts, INFORMS Journal on Computing, vol.22, pp.401-415, 2010.

L. Finta and Z. Liu, Single machine scheduling subject to precedence delays, Discrete Applied Mathematics, vol.70, issue.3, pp.247-266, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00074473

M. Gendreau, G. Laporte, and F. Semet, Heuristics and lower bounds for the bin packing problem with conflicts, Computers & Operations Research, vol.31, issue.3, pp.347-358, 2004.

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

V. Leonid and . Kantorovich, Mathematical methods of organizing and planning production, vol.6, pp.366-422, 1960.

A. Khanafer, F. Clautiaux, and E. Talbi, New lower bounds for bin packing problems with conflicts, European Journal of Operational Research, vol.206, issue.2, pp.281-288, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00522668

A. Khanafer, F. Clautiaux, and E. Talbi, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Computers & Operations Research, vol.39, issue.1, pp.54-63, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00750717

R. Kramer, M. Dell?amico, and M. Iori, A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints, International Journal of Production Research, vol.55, issue.21, pp.6288-6304, 2017.

. O-kullmann, Handbook of Satisfiability, chapter Fundaments of branching heuristics, pp.205-244, 2009.

. David-r-morrison, C. Edward, S. Sewell, and . Jacobson, An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset, European Journal of Operational Research, vol.236, issue.2, pp.403-409, 2014.

A. Otto, C. Otto, and A. Scholl, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing, European Journal of Operational Research, vol.228, issue.1, pp.33-45, 2013.

J. Pereira, Empirical evaluation of lower bounding methods for the simple assembly line balancing problem, International Journal of Production Research, vol.53, issue.11, pp.3327-3340, 2014.

J. Pereira, Procedures for the bin packing problem with precedence constraints, European Journal of Operational Research, vol.250, issue.3, pp.794-806, 2016.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, INFORMS Journal on Computing, vol.30, issue.2, pp.339-360, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01077984

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, A generic exact solver for vehicle routing and related problems, Mathematical Programming, vol.183, issue.1-2, pp.483-523, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02178171

D. M. Ryan and B. A. Foster, An integer programming approach to scheduling, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp.269-280, 1981.

R. Sadykov and F. Vanderbeck, Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm, INFORMS Journal on Computing, vol.25, issue.2, pp.244-255, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00539869

R. Sadykov, F. Vanderbeck, A. Pessoa, I. Tahiri, and E. Uchoa, Primal Heuristics for Branch and Price: The Assets of Diving Methods, INFORMS Journal on Computing, vol.31, issue.2, pp.251-267, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01237204

A. Scholl and C. Becker, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, European Journal of Operational Research, vol.168, issue.3, pp.666-693, 2006.

F. Vanderbeck, R. Sadykov, and I. Tahiri, BaPCod -a generic Branch-And-Price Code, 2020.

L. Wei, Z. Luo, R. Baldacci, and A. Lim, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, INFORMS Journal on Computing, vol.32, issue.2, pp.428-443, 2020.