 | 2008 |
|---|
| 8 |       | Stefan Irnich:
Undirected postman problems with zigzagging option: A cutting-plane approach.
Computers & OR 35(12): 3998-4009 (2008) |
| 7 | | Stefan Irnich:
Solution of real-world postman problems.
European Journal of Operational Research 190(1): 52-67 (2008) |
| 6 | | Stefan Irnich:
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics.
INFORMS Journal on Computing 20(2): 270-287 (2008) |
| 2006 |
|---|
| 5 | | Stefan Irnich,
Birger Funke,
Tore Grünert:
Sequential search and its application to vehicle-routing problems.
Computers & OR 33: 2405-2429 (2006) |
| 4 | | Stefan Irnich,
Daniel Villeneuve:
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3.
INFORMS Journal on Computing 18(3): 391-406 (2006) |
| 2005 |
|---|
| 3 | | Birger Funke,
Tore Grünert,
Stefan Irnich:
A Note on Single Alternating Cycle Neighborhoods for the TSP.
J. Heuristics 11(2): 135-146 (2005) |
| 2 | | Birger Funke,
Tore Grünert,
Stefan Irnich:
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration.
J. Heuristics 11(4): 267-306 (2005) |
| 2002 |
|---|
| 1 | | Tore Grünert,
Stefan Irnich,
Hans-Jürgen Zimmermann,
Markus Schneider,
Burkhard Wulfhorst:
Finding all k-cliques in k-partite graphs, an application in textile engineering.
Computers & OR 29(1): 13-31 (2002) |
