François Clautiaux

46 papers B 1C 5Journal 35Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems.
Comput. Oper. Res.
Fulin Yan, François Clautiaux, Aurélien Froger, Boris Albar
2025 J jnl
Last fifty years of integer linear programming: A focus on recent practical advances.
Eur. J. Oper. Res.
François Clautiaux, Ivana Ljubic
2025 J jnl
Mathematical models based on decision hypergraphs for designing a storage cabinet.
Eur. J. Oper. Res.
Luis Marques, François Clautiaux, Aurélien Froger
2025 J jnl
Models and algorithms for configuring and testing prototype cars.
Comput. Oper. Res.
François Clautiaux, Siham Essodaigui, Alain Nguyen, Ruslan Sadykov, Nawel Younes
2023 J jnl
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty.
J. Sched.
François Clautiaux, Boris Detienne, Henri Lefebvre
2023 J jnl
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.
Xavier Blanchot, François Clautiaux, Boris Detienne, Aurélien Froger, Manuel Ruiz
2022 J jnl
Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res.
Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
2022 J jnl
Bin Packing Problem with Time Lags.
INFORMS J. Comput.
Orlando Rivera Letelier, François Clautiaux, Ruslan Sadykov
2021 J jnl
An iterative dynamic programming approach for the temporal knapsack problem.
Eur. J. Oper. Res.
François Clautiaux, Boris Detienne, Gaël Guillot
2020 J jnl
Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications.
CoRR
Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
2019 J jnl
Exact approaches for solving a covering problem with capacitated subtrees.
Comput. Oper. Res.
François Clautiaux, Jérémy Guillot, Pierre Pesneau
2019 J jnl
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers.
EURO J. Comput. Optim.
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
2018 J jnl
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
Discret. Optim.
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
2017 J jnl
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems.
INFORMS J. Comput.
Daniel Porumbel, François Clautiaux
2017 J jnl
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.
Eur. J. Oper. Res.
François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves
2016 J jnl
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce.
Eur. J. Oper. Res.
Matthieu Gérard, François Clautiaux, Ruslan Sadykov
2015 J jnl
Constructing general dual-feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
2014 J jnl
Lower and upper bounds for the Bin Packing Problem with Fragile Objects.
Discret. Appl. Math.
François Clautiaux, Mauro Dell'Amico, Manuel Iori, Ali Khanafer
2014 J jnl
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res.
Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Jürgen Rietz
2014 — conf
On the Properties of General Dual-Feasible Functions.
ICCSA (2)
Jürgen Rietz, Cláudio Alves, José Manuel Valério de Carvalho, François Clautiaux
2014 J jnl
Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem.
Appl. Soft Comput.
Nadia Dahmani, François Clautiaux, Saoussen Krichen, El-Ghazali Talbi
2013 C conf
A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem.
COCOA
Nadia Dahmani, Saoussen Krichen, François Clautiaux, El-Ghazali Talbi
2013 J jnl
A New Graph-Theoretical Model for the Guillotine-Cutting Problem.
INFORMS J. Comput.
François Clautiaux, Antoine Jouglet, Aziz Moukrim
2013 J jnl
Exact algorithms for the bin packing problem with fragile objects.
Discret. Optim.
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
2013 J jnl
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem.
Comput. Ind. Eng.
Nadia Dahmani, François Clautiaux, Saoussen Krichen, El-Ghazali Talbi
2012 C conf
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
ICORES
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
2012 C conf
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.
ICORES
Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
2012 J jnl
The min-conflict packing problem.
Comput. Oper. Res.
Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi
2012 C conf
Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models.
ISCO
Marie-Emilie Voge, François Clautiaux
2012 J jnl
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts.
Comput. Oper. Res.
Ali Khanafer, François Clautiaux, El-Ghazali Talbi
2011 C conf
Models and Algorithms for the Bin Packing Problem with Fragile Objects.
CTW
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
2011 J jnl
New Stabilization Procedures for the Cutting Stock Problem.
INFORMS J. Comput.
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz
2011 J jnl
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res.
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi
2010 J jnl
A survey of dual-feasible and superadditive functions.
Ann. Oper. Res.
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
2010 B conf
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
SEA
Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut
2010 — book
New collaborative approaches for bin-packing problems.
François Clautiaux
2010 J jnl
New lower bounds for bin packing problems with conflicts.
Eur. J. Oper. Res.
Ali Khanafer, François Clautiaux, El-Ghazali Talbi
2008 — conf
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.
WEA
François Clautiaux, Antoine Jouglet, Aziz Moukrim
2008 J jnl
A new constraint programming approach for the orthogonal packing problem.
Comput. Oper. Res.
François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
2007 J jnl
A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett.
François Clautiaux, Jacques Carlier, Aziz Moukrim
2007 J jnl
A new exact method for the two-dimensional orthogonal packing problem.
Eur. J. Oper. Res.
François Clautiaux, Jacques Carlier, Aziz Moukrim
2007 J jnl
A new lower bound for the non-oriented two-dimensional bin-packing problem.
Oper. Res. Lett.
François Clautiaux, Antoine Jouglet, Joseph El Hayek
2007 J jnl
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Comput. Oper. Res.
Jacques Carlier, François Clautiaux, Aziz Moukrim
2005 — —
Bornes inférieures et méthodes exactes pour le problème de bin packing en deux dimensions avec orientation fixe.
François Clautiaux
2004 J jnl
Heuristic and metaheuristic methods for computing graph treewidth.
RAIRO Oper. Res.
François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier
2003 — conf
New Lower and Upper Bounds for Graph Treewidth.
WEA
François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre