François Clautiaux
Orcid: 0000-0002-9171-8012
According to our database1,
François Clautiaux
authored at least 43 papers
between 2003 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Eur. J. Oper. Res., 2025
Comput. Oper. Res., 2025
2023
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., August, 2023
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty.
J. Sched., 2023
2022
Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res., 2022
2021
Eur. J. Oper. Res., 2021
2019
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers.
EURO J. Comput. Optim., 2019
Comput. Oper. Res., 2019
2018
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
Discret. Optim., 2018
2017
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems.
INFORMS J. Comput., 2017
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.
Eur. J. Oper. Res., 2017
2016
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce.
Eur. J. Oper. Res., 2016
2015
2014
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res., 2014
Discret. Appl. Math., 2014
Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem.
Appl. Soft Comput., 2014
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014
2013
INFORMS J. Comput., 2013
Discret. Optim., 2013
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem.
Comput. Ind. Eng., 2013
A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts.
Comput. Oper. Res., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
Proceedings of the ICORES 2012, 2012
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.
Proceedings of the ICORES 2012, 2012
2011
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res., 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2008
Comput. Oper. Res., 2008
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008
2007
Oper. Res. Lett., 2007
A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett., 2007
Eur. J. Oper. Res., 2007
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Comput. Oper. Res., 2007
2005
Bornes inférieures et méthodes exactes pour le problème de bin packing en deux dimensions avec orientation fixe.
PhD thesis, 2005
2004
RAIRO Oper. Res., 2004
2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003