François Clautiaux

ORCID

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 12

Top Venues

University of Technology of Compiègne, France (PHD)

Education History

University of Technology of Compiègne, France

PHD

Publications

Xavier Blanchot, François Clautiaux, Boris Detienne, Aurélien Froger, Manuel Ruiz
The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs. Eur. J. Oper. Res. 309 (1) (2023)
François Clautiaux, Boris Detienne, Henri Lefebvre
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. J. Sched. 26 (2) (2023)
Orlando Rivera Letelier, François Clautiaux, Ruslan Sadykov
Bin Packing Problem with Time Lags. INFORMS J. Comput. 34 (4) (2022)
Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
Arc flow formulations based on dynamic programming: Theoretical foundations and applications. Eur. J. Oper. Res. 296 (1) (2022)
François Clautiaux, Boris Detienne, G. Guillot
An iterative dynamic programming approach for the temporal knapsack problem. Eur. J. Oper. Res. 293 (2) (2021)
Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications. CoRR (2020)
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. EURO J. Comput. Optim. 7 (3) (2019)
François Clautiaux, Jérémy Guillot, Pierre Pesneau
Exact approaches for solving a covering problem with capacitated subtrees. Comput. Oper. Res. 105 (2019)
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discret. Optim. 29 (2018)
Daniel Porumbel, François Clautiaux
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems. INFORMS J. Comput. 29 (1) (2017)
François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258 (2) (2017)
Matthieu Gérard, François Clautiaux, Ruslan Sadykov
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. Eur. J. Oper. Res. 252 (3) (2016)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
Constructing general dual-feasible functions. Oper. Res. Lett. 43 (4) (2015)
Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Jürgen Rietz
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur. J. Oper. Res. 233 (1) (2014)
Nadia Dahmani, François Clautiaux, Saoussen Krichen, El-Ghazali Talbi
Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem. Appl. Soft Comput. 16 (2014)
François Clautiaux, Mauro Dell'Amico, Manuel Iori, Ali Khanafer
Lower and upper bounds for the Bin Packing Problem with Fragile Objects. Discret. Appl. Math. 163 (2014)
Jürgen Rietz, Cláudio Alves, José Manuel Valério de Carvalho, François Clautiaux
On the Properties of General Dual-Feasible Functions. ICCSA (2) (2014)
Nadia Dahmani, François Clautiaux, Saoussen Krichen, El-Ghazali Talbi
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem. Comput. Ind. Eng. 66 (1) (2013)
Nadia Dahmani, Saoussen Krichen, François Clautiaux, El-Ghazali Talbi
A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem. COCOA (2013)
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
Exact algorithms for the bin packing problem with fragile objects. Discret. Optim. 10 (3) (2013)
François Clautiaux, Antoine Jouglet, Aziz Moukrim
A New Graph-Theoretical Model for the Guillotine-Cutting Problem. INFORMS J. Comput. 25 (1) (2013)
Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. ICORES (2012)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments. ICORES (2012)
Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi
The min-conflict packing problem. Comput. Oper. Res. 39 (9) (2012)
Ali Khanafer, François Clautiaux, El-Ghazali Talbi
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. Comput. Oper. Res. 39 (1) (2012)
Marie-Emilie Voge, François Clautiaux
Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models. ISCO (2012)
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214 (3) (2011)
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz
New Stabilization Procedures for the Cutting Stock Problem. INFORMS J. Comput. 23 (4) (2011)
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
Models and Algorithms for the Bin Packing Problem with Fragile Objects. CTW (2011)
Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. SEA (2010)
Ali Khanafer, François Clautiaux, El-Ghazali Talbi
New lower bounds for bin packing problems with conflicts. Eur. J. Oper. Res. 206 (2) (2010)
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179 (1) (2010)
François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35 (3) (2008)
François Clautiaux, Antoine Jouglet, Aziz Moukrim
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. WEA (2008)
François Clautiaux, Jacques Carlier, Aziz Moukrim
A new exact method for the two-dimensional bin-packing problem with fixed orientation. Oper. Res. Lett. 35 (3) (2007)
Jacques Carlier, François Clautiaux, Aziz Moukrim
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Comput. Oper. Res. 34 (8) (2007)
François Clautiaux, Antoine Jouglet, Joseph El Hayek
A new lower bound for the non-oriented two-dimensional bin-packing problem. Oper. Res. Lett. 35 (3) (2007)
François Clautiaux, Jacques Carlier, Aziz Moukrim
A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183 (3) (2007)
François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier
Heuristic and metaheuristic methods for computing graph treewidth. RAIRO Oper. Res. 38 (1) (2004)
François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
New Lower and Upper Bounds for Graph Treewidth. WEA (2003)

François Clautiaux.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

François Clautiaux