| 2008 |
|---|
| 8 | EE | Ivo Blöchliger,
Nicolas Zufferey:
A graph coloring heuristic using partial solutions and a reactive tabu scheme.
Computers & OR 35(3): 960-975 (2008) |
| 7 | EE | Alain Hertz,
Matthieu Plumettaz,
Nicolas Zufferey:
Variable space search for graph coloring.
Discrete Applied Mathematics 156(13): 2551-2560 (2008) |
| 6 | EE | Philippe Galinier,
Alain Hertz,
Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem.
Discrete Applied Mathematics 156(2): 267-279 (2008) |
| 5 | EE | Nicolas Zufferey,
Patrick Amstutz,
Philippe Giaccari:
Graph colouring approaches for a satellite range scheduling problem.
J. Scheduling 11(4): 263-277 (2008) |
| 2007 |
|---|
| 4 | EE | Luc Luyet,
Sacha Varone,
Nicolas Zufferey:
An Ant Algorithm for the Steiner Tree Problem in Graphs.
EvoWorkshops 2007: 42-51 |
| 2006 |
|---|
| 3 | | Nicolas Zufferey,
Martin Studer,
Edward A. Silver:
Tabu Search for a Car Sequencing Problem.
FLAIRS Conference 2006: 457-462 |
| 2005 |
|---|
| 2 | EE | Alain Hertz,
David Schindl,
Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.
4OR 3(2): 139-161 (2005) |
| 2003 |
|---|
| 1 | EE | Cédric Avanthay,
Alain Hertz,
Nicolas Zufferey:
A variable neighborhood search for graph coloring.
European Journal of Operational Research 151(2): 379-388 (2003) |
