François Clautiaux

Orcid: 0000-0002-9171-8012

According to our database1, François Clautiaux authored at least 41 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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
Bin Packing Problem with Time Lags.
INFORMS J. Comput., 2022

Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res., 2022

2021
An iterative dynamic programming approach for the temporal knapsack problem.
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

Exact approaches for solving a covering problem with capacitated subtrees.
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
Constructing general dual-feasible functions.
Oper. Res. Lett., 2015

2014
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res., 2014

Lower and upper bounds for the Bin Packing Problem with Fragile Objects.
Discret. Appl. Math., 2014

Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem.
Appl. Soft Comput., 2014

On the Properties of General Dual-Feasible Functions.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2013
A New Graph-Theoretical Model for the Guillotine-Cutting Problem.
INFORMS J. Comput., 2013

Exact algorithms for the bin packing problem with fragile objects.
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

The min-conflict packing problem.
Comput. Oper. Res., 2012

Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models.
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
New Stabilization Procedures for the Cutting Stock Problem.
INFORMS J. Comput., 2011

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res., 2011

Models and Algorithms for the Bin Packing Problem with Fragile Objects.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
New lower bounds for bin packing problems with conflicts.
Eur. J. Oper. Res., 2010

A survey of dual-feasible and superadditive functions.
Ann. Oper. Res., 2010

New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

New collaborative approaches for bin-packing problems.
, 2010

2008
A new constraint programming approach for the orthogonal packing problem.
Comput. Oper. Res., 2008

A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
A new lower bound for the non-oriented two-dimensional bin-packing problem.
Oper. Res. Lett., 2007

A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett., 2007

A new exact method for the two-dimensional orthogonal packing problem.
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
Heuristic and metaheuristic methods for computing graph treewidth.
RAIRO Oper. Res., 2004

2003
New Lower and Upper Bounds for Graph Treewidth.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003


  Loading...