New Lower and Upper Bounds for Graph Treewidth. - François Clautiaux; Jacques Carlier; Aziz Moukrim; Stéphane Nègre (WEA, 2003)

Heuristic and metaheuristic methods for computing graph treewidth. - François Clautiaux; Aziz Moukrim; Stéphane Nègre; Jacques Carlier (RAIRO Oper. Res., 2004)

Bornes inférieures et méthodes exactes pour le problème de bin packing en deux dimensions avec orientation fixe. - François Clautiaux (2005)

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. - Jacques Carlier; François Clautiaux; Aziz Moukrim (Comput. Oper. Res., 2007)

A new exact method for the two-dimensional orthogonal packing problem. - François Clautiaux; Jacques Carlier; Aziz Moukrim (Eur. J. Oper. Res., 2007)

A new exact method for the two-dimensional bin-packing problem with fixed orientation. - François Clautiaux; Jacques Carlier; Aziz Moukrim (Oper. Res. Lett., 2007)

A new lower bound for the non-oriented two-dimensional bin-packing problem. - François Clautiaux; Antoine Jouglet; Joseph El Hayek (Oper. Res. Lett., 2007)

A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. - François Clautiaux; Antoine Jouglet; Aziz Moukrim (WEA, 2008)

A new constraint programming approach for the orthogonal packing problem. - François Clautiaux; Antoine Jouglet; Jacques Carlier; Aziz Moukrim (Comput. Oper. Res., 2008)

New collaborative approaches for bin-packing problems. - François Clautiaux (2010)

New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. - Minh Hoang Ha; François Clautiaux; Saïd Hanafi; Christophe Wilbaut (SEA, 2010)

A survey of dual-feasible and superadditive functions. - François Clautiaux; Cláudio Alves; José M. Valério de Carvalho (Ann. Oper. Res., 2010)

New lower bounds for bin packing problems with conflicts. - Ali Khanafer 001; François Clautiaux; El-Ghazali Talbi (Eur. J. Oper. Res., 2010)

Models and Algorithms for the Bin Packing Problem with Fragile Objects. - Manuel A. Alba Martínez; François Clautiaux; Mauro Dell'Amico; Manuel Iori (CTW, 2011)

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. - Rita Macedo; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux; Saïd Hanafi (Eur. J. Oper. Res., 2011)

New Stabilization Procedures for the Cutting Stock Problem. - François Clautiaux; Cláudio Alves; José M. Valério de Carvalho; Jürgen Rietz (INFORMS J. Comput., 2011)

Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. - Rita Macedo; Saïd Hanafi; François Clautiaux; Cláudio Alves; José M. Valério de Carvalho (ICORES, 2012)

Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux (ICORES, 2012)

Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models. - Marie-Emilie Voge; François Clautiaux (ISCO, 2012)

The min-conflict packing problem. - Ali Khanafer 001; François Clautiaux; Saïd Hanafi; El-Ghazali Talbi (Comput. Oper. Res., 2012)

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. - Ali Khanafer 001; François Clautiaux; El-Ghazali Talbi (Comput. Oper. Res., 2012)

A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem. - Nadia Dahmani; Saoussen Krichen; François Clautiaux; El-Ghazali Talbi (COCOA, 2013)

Iterative approaches for solving a multi-objective 2-dimensional vector packing problem. - Nadia Dahmani; François Clautiaux; Saoussen Krichen; El-Ghazali Talbi (Comput. Ind. Eng., 2013)

Exact algorithms for the bin packing problem with fragile objects. - Manuel A. Alba Martínez; François Clautiaux; Mauro Dell'Amico; Manuel Iori (Discret. Optim., 2013)

A New Graph-Theoretical Model for the Guillotine-Cutting Problem. - François Clautiaux; Antoine Jouglet; Aziz Moukrim (INFORMS J. Comput., 2013)

On the Properties of General Dual-Feasible Functions. - Jürgen Rietz; Cláudio Alves; José Manuel Valério de Carvalho; François Clautiaux (ICCSA (2), 2014)

Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem. - Nadia Dahmani; François Clautiaux; Saoussen Krichen; El-Ghazali Talbi (Appl. Soft Comput., 2014)

Lower and upper bounds for the Bin Packing Problem with Fragile Objects. - François Clautiaux; Mauro Dell'Amico; Manuel Iori; Ali Khanafer 001 (Discret. Appl. Math., 2014)

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. - Cláudio Alves; José M. Valério de Carvalho; François Clautiaux; Jürgen Rietz (Eur. J. Oper. Res., 2014)

Constructing general dual-feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux (Oper. Res. Lett., 2015)

Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. - Matthieu Gérard; François Clautiaux; Ruslan Sadykov (Eur. J. Oper. Res., 2016)

Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. - François Clautiaux; Saïd Hanafi; Rita Macedo; Marie-Emilie Voge; Cláudio Alves (Eur. J. Oper. Res., 2017)

Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems. - Daniel Porumbel; François Clautiaux (INFORMS J. Comput., 2017)

Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. - François Clautiaux; Ruslan Sadykov; François Vanderbeck; Quentin Viaud (Discret. Optim., 2018)

Exact approaches for solving a covering problem with capacitated subtrees. - François Clautiaux; Jérémy Guillot; Pierre Pesneau (Comput. Oper. Res., 2019)

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. - François Clautiaux; Ruslan Sadykov; François Vanderbeck; Quentin Viaud (EURO J. Comput. Optim., 2019)

An iterative dynamic programming approach for the temporal knapsack problem. - François Clautiaux; Boris Detienne; Gaël Guillot (Eur. J. Oper. Res., 2021)

Arc flow formulations based on dynamic programming: Theoretical foundations and applications. - Vinícius Loti de Lima; Cláudio Alves; François Clautiaux; Manuel Iori; José M. Valério de Carvalho (Eur. J. Oper. Res., 2022)

Bin Packing Problem with Time Lags. - Orlando Rivera Letelier; François Clautiaux; Ruslan Sadykov (INFORMS J. Comput., 2022)

A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. - François Clautiaux; Boris Detienne; Henri Lefebvre (J. Sched., 2023)

The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs. - Xavier Blanchot; François Clautiaux; Boris Detienne; Aurélien Froger; Manuel Ruiz (Eur. J. Oper. Res., 2023)

Models and algorithms for configuring and testing prototype cars. - François Clautiaux; Siham Essodaigui; Alain Nguyen; Ruslan Sadykov; Nawel Younes (Comput. Oper. Res., 2025)

Last fifty years of integer linear programming: A focus on recent practical advances. - François Clautiaux; Ivana Ljubic (Eur. J. Oper. Res., 2025)

Mathematical models based on decision hypergraphs for designing a storage cabinet. - Luis Marques; François Clautiaux; Aurélien Froger (Eur. J. Oper. Res., 2025)