| |
| 2006 | ||
|---|---|---|
| 5 | EE | Cees Duin, E. Van Der Sluis: On the Complexity of Adjacent Resource Scheduling. J. Scheduling 9(1): 49-62 (2006) |
| 2005 | ||
| 4 | EE | Stefan Voß, Andreas Fink, Cees Duin: Looking Ahead with the Pilot Method. Annals OR 136(1): 285-302 (2005) |
| 2004 | ||
| 3 | EE | Cees Duin: A Branch-Checking Algorithm for All-Pairs Shortest Paths. Algorithmica 41(2): 131-145 (2004) |
| 1999 | ||
| 2 | EE | Cees Duin, Stefan Voß: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34(3): 181-191 (1999) |
| 1997 | ||
| 1 | EE | Cees Duin, Stefan Voß: Efficient path and vertex exchange in steiner tree algorithms. Networks 29(2): 89-105 (1997) |
| 1 | Andreas Fink | [4] |
| 2 | E. Van Der Sluis | [5] |
| 3 | Stefan Voß | [1] [2] [4] |