Stéphane Nègre

According to our database1, Stéphane Nègre authored at least 10 papers between 1995 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem.
Int. Trans. Oper. Res., 2014

A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

A hybrid large neighborhood search for the pickup and delivery problem with time windows.
Proceedings of the International Conference on Control, 2014

2012
A parallel algorithm for constrained two-staged two-dimensional cutting problems.
Comput. Ind. Eng., 2012

2011
An augmented beam search-based algorithm for the circular open dimension problem.
Comput. Ind. Eng., 2011

2010
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem.
Electron. Notes Discret. Math., 2010

2008
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem.
Comput. Oper. Res., 2008

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

1995
Three Methods Used to Solve an Examination Timetable Problem.
Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995


  Loading...