Three Methods Used to Solve an Examination Timetable Problem. - Jean-Paul Boufflet; Stéphane Nègre (PATAT, 1995)

New Lower and Upper Bounds for Graph Treewidth. - François Clautiaux; Jacques Carlier; Aziz Moukrim; Stéphane Nègre (WEA, 2003)

Heuristic and metaheuristic methods for computing graph treewidth. - François Clautiaux; Aziz Moukrim; Stéphane Nègre; Jacques Carlier (RAIRO Oper. Res., 2004)

New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. - Joseph El Hayek; Aziz Moukrim; Stéphane Nègre (Comput. Oper. Res., 2008)

A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. - Mhand Hifi; Imed Kacem; Stéphane Nègre; Lei Wu 005 (Electron. Notes Discret. Math., 2010)

An augmented beam search-based algorithm for the circular open dimension problem. - Hakim Akeb; Mhand Hifi; Stéphane Nègre (Comput. Ind. Eng., 2011)

A parallel algorithm for constrained two-staged two-dimensional cutting problems. - Mhand Hifi; Stéphane Nègre; Rachid Ouafi; Toufik Saadi (Comput. Ind. Eng., 2012)

A hybrid large neighborhood search for the pickup and delivery problem with time windows. - Mhand Hifi; Laurent Moreau; Stéphane Nègre; Lei Wu 005 (CoDIT, 2014)

A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. - Mhand Hifi; Stéphane Nègre; Toufik Saadi; Sagvan Saleh; Lei Wu 005 (IPDPS Workshops, 2014)

Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. - Mhand Hifi; Stéphane Nègre; Lei Wu 005 (Int. Trans. Oper. Res., 2014)