#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2002

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
- Computers & OR
- 2008

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method for 2OPP, based on a… (More)

- Jacques Carlier, François Clautiaux, Aziz Moukrim
- Computers & OR
- 2007

- François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier
- RAIRO - Operations Research
- 2004

The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization… (More)

- François Clautiaux, Jacques Carlier, Aziz Moukrim
- European Journal of Operational Research
- 2007

The two-dimensional orthogonal packing problem (2OPP ) consists of determining if a set of rectangles (items) can be packed into one rectangle of fixed size (bin). In this paper we propose two exact… (More)

- Ali Khanafer, François Clautiaux, El-Ghazali Talbi
- European Journal of Operational Research
- 2010

0377-2217/$ see front matter 2010 Published by doi:10.1016/j.ejor.2010.01.037 * Corresponding author. E-mail addresses: Ali.Khanafer@inria.fr (A. Kh univ-lillel.fr (F. Clautiaux),… (More)

- Rita Macedo, Cláudio Nahum Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi
- European Journal of Operational Research
- 2011

In this paper, we address a variant of the vehicle routing problem called the vehicle routing problem with time windows and multiple routes. It considers that a given vehicle can be assigned to more… (More)

- François Clautiaux, Cláudio Nahum Alves, José M. Valério de Carvalho
- Annals OR
- 2010

Dual-feasible functions are valuable tools that can be used to compute both lower bounds for different combinatorial problems and valid inequalities for integer programs. Several families of… (More)

- Ali Khanafer, François Clautiaux, El-Ghazali Talbi
- Computers & OR
- 2012

This paper deals with the two-dimensional bin packing problem with conflicts (BPC-2D). Given a finite set of rectangular items, an unlimited number of rectangular bins and a conflict graph, the goal… (More)

- François Clautiaux, Antoine Jouglet, Aziz Moukrim
- INFORMS Journal on Computing
- 2013

We consider the problem of determining whether a given set of rectangular items can be cut from a larger rectangle using so-called guillotine cuts only. We introduce a new class of arc-colored… (More)