default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Clautiaux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j31]François Clautiaux
, Siham Essodaigui, Alain Nguyen, Ruslan Sadykov, Nawel Younes:
Models and algorithms for configuring and testing prototype cars. Comput. Oper. Res. 173: 106834 (2025)- 2023
- [j30]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): 202-216 (2023) - [j29]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): 169-191 (2023) - 2022
- [j28]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): 3-21 (2022) - [j27]Orlando Rivera Letelier, François Clautiaux, Ruslan Sadykov:
Bin Packing Problem with Time Lags. INFORMS J. Comput. 34(4): 2249-2270 (2022) - 2021
- [j26]François Clautiaux, Boris Detienne, G. Guillot:
An iterative dynamic programming approach for the temporal knapsack problem. Eur. J. Oper. Res. 293(2): 442-456 (2021) - 2020
- [i1]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 abs/2010.00558 (2020)
2010 – 2019
- 2019
- [j25]François Clautiaux, Jérémy Guillot, Pierre Pesneau:
Exact approaches for solving a covering problem with capacitated subtrees. Comput. Oper. Res. 105: 85-101 (2019) - [j24]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): 265-297 (2019) - 2018
- [j23]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: 18-44 (2018) - 2017
- [j22]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): 467-477 (2017) - [j21]Daniel Porumbel, François Clautiaux:
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems. INFORMS J. Comput. 29(1): 170-184 (2017) - 2016
- [j20]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): 1019-1030 (2016) - 2015
- [j19]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): 427-431 (2015) - 2014
- [j18]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: 124-136 (2014) - [j17]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: 73-86 (2014) - [j16]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): 43-63 (2014) - [c9]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: 180-194 - 2013
- [j15]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): 158-170 (2013) - [j14]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): 210-223 (2013) - [j13]François Clautiaux, Antoine Jouglet, Aziz Moukrim:
A New Graph-Theoretical Model for the Guillotine-Cutting Problem. INFORMS J. Comput. 25(1): 72-86 (2013) - [c8]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: 37-48 - 2012
- [j12]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): 54-63 (2012) - [j11]Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi:
The min-conflict packing problem. Comput. Oper. Res. 39(9): 2122-2132 (2012) - [c7]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: 39-47 - [c6]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: 305-312 - [c5]Marie-Emilie Voge, François Clautiaux:
Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models. ISCO 2012: 213-224 - 2011
- [j10]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): 536-545 (2011) - [j9]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): 530-545 (2011) - [c4]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: 36-39 - 2010
- [b2]François Clautiaux:
New collaborative approaches for bin-packing problems. University of Technology of Compiègne, France, 2010 - [j8]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): 317-342 (2010) - [j7]Ali Khanafer, François Clautiaux, El-Ghazali Talbi:
New lower bounds for bin packing problems with conflicts. Eur. J. Oper. Res. 206(2): 281-288 (2010) - [c3]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: 302-313
2000 – 2009
- 2008
- [j6]François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim:
A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3): 944-959 (2008) - [c2]François Clautiaux, Antoine Jouglet, Aziz Moukrim:
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. WEA 2008: 43-54 - 2007
- [j5]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): 2223-2250 (2007) - [j4]François Clautiaux, Jacques Carlier, Aziz Moukrim:
A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3): 1196-1211 (2007) - [j3]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): 357-364 (2007) - [j2]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): 365-373 (2007) - 2005
- [b1]François Clautiaux:
Bornes inférieures et méthodes exactes pour le problème de bin packing en deux dimensions avec orientation fixe. University of Technology of Compiègne, France, 2005 - 2004
- [j1]François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier:
Heuristic and metaheuristic methods for computing graph treewidth. RAIRO Oper. Res. 38(1): 13-26 (2004) - 2003
- [c1]François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre:
New Lower and Upper Bounds for Graph Treewidth. WEA 2003: 70-80
Coauthor Index
aka: José Manuel Valério de Carvalho
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
