Shortest path problems with resource constraints S Irnich, G Desaulniers Column generation, 33-65, 2005 | 841 | 2005 |
Exact algorithms for electric vehicle-routing problems with time windows G Desaulniers, F Errico, S Irnich, M Schneider Operations Research 64 (6), 1388-1405, 2016 | 501 | 2016 |
The shortest path problem with k-Cycle elimination (k 3): Improving branch and price algorithms for vehicle routing and scheduling S Irnich, D Villeneuve | 376* | 2000 |
Chapter 1: The family of vehicle routing problems S Irnich, P Toth, D Vigo Vehicle Routing: Problems, Methods, and Applications, Second Edition, 1-33, 2014 | 222 | 2014 |
Local search for vehicle routing and scheduling problems: Review and conceptual integration B Funke, T Grünert, S Irnich Journal of heuristics 11, 267-306, 2005 | 177 | 2005 |
Resource extension functions: Properties, inversion, and generalization to segments S Irnich OR Spectrum 30 (1), 113-148, 2008 | 164 | 2008 |
A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles S Irnich European Journal of Operational Research 122 (2), 310-328, 2000 | 126 | 2000 |
Sequential search and its application to vehicle-routing problems S Irnich, B Funke, T Grünert Computers & Operations Research 33 (8), 2405-2429, 2006 | 106 | 2006 |
Formulations for an inventory routing problem C Archetti, N Bianchessi, S Irnich, MG Speranza International Transactions in Operational Research 21 (3), 353-374, 2014 | 104 | 2014 |
Effective handling of dynamic time windows and its application to solving the dial-a-ride problem T Gschwind, S Irnich Transportation Science 49 (2), 335-354, 2015 | 93 | 2015 |
A unified modeling and solution framework for vehicle routing and local search-based metaheuristics S Irnich INFORMS Journal on Computing 20 (2), 270-287, 2008 | 93 | 2008 |
Chapter 9: Four variants of the vehicle routing problem S Irnich, M Schneider, D Vigo Vehicle Routing: Problems, Methods, and Applications, Second Edition, 241-271, 2014 | 87 | 2014 |
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster C Tilk, AK Rothenbächer, T Gschwind, S Irnich European Journal of Operational Research 261 (2), 530-539, 2017 | 86 | 2017 |
An exact method for vehicle routing and truck driver scheduling problems A Goel, S Irnich Transportation Science 51 (2), 737-754, 2017 | 86 | 2017 |
Path-reduced costs for eliminating arcs in routing and scheduling S Irnich, G Desaulniers, J Desrosiers, A Hadjar INFORMS Journal on Computing 22 (2), 297-313, 2010 | 86 | 2010 |
Cut-first branch-and-price-second for the capacitated arc-routing problem C Bode, S Irnich Operations research 60 (5), 1167-1182, 2012 | 84 | 2012 |
Optimierung im Transport T Grünert, S Irnich Shaker Verlag, 2005 | 83* | 2005 |
Solution of real-world postman problems S Irnich European journal of operational research 190 (1), 52-67, 2008 | 71 | 2008 |
Large multiple neighborhood search for the clustered vehicle-routing problem T Hintsch, S Irnich European Journal of Operational Research 270 (1), 118-131, 2018 | 70 | 2018 |
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks M Cherkesly, G Desaulniers, S Irnich, G Laporte European Journal of Operational Research 250 (3), 782-793, 2016 | 67 | 2016 |