Stéphane Nègre

Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem

Lei Wu, Mhand Hifi, Stéphane Nègre, 2014, Int. Trans. Oper. Res..

Heuristic and metaheuristic methods for computing graph treewidth

Jacques Carlier, Aziz Moukrim, François Clautiaux, 2004, RAIRO Oper. Res..

A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem

Lei Wu, Mhand Hifi, Imed Kacem, 2010, Electron. Notes Discret. Math..

An augmented beam search-based algorithm for the circular open dimension problem

Mhand Hifi, Stéphane Nègre, Hakim Akeb, 2009, 2009 International Conference on Computers & Industrial Engineering.

A parallel algorithm for constrained two-staged two-dimensional cutting problems

Mhand Hifi, Stéphane Nègre, Rachid Ouafi, 2012, Comput. Ind. Eng..

New Lower and Upper Bounds for Graph Treewidth

Jacques Carlier, Aziz Moukrim, François Clautiaux, 2003, WEA.

New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

Aziz Moukrim, Stéphane Nègre, Joseph El Hayek, 2008, Comput. Oper. Res..

A hybrid large neighborhood search for the pickup and delivery problem with time windows

Lei Wu, Mhand Hifi, Stéphane Nègre, 2014, 2014 International Conference on Control, Decision and Information Technologies (CoDIT).

Three Methods Used to Solve an Examination Timetable Problem

Stéphane Nègre, Jean Paul Boufflet, 1995, PATAT.

A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem

Lei Wu, Mhand Hifi, Stéphane Nègre, 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

A TABU SEARCH METHOD FOR THE NON-ORIENTED TWO-DIMENSIONAL BIN-PACKING PROBLEM

Aziz Moukrim, Stéphane Nègre, J. El Hayek, 2006 .