Stefan Irnich

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 44

Top Topics

Traveling Salesman

Routing Problem

Vehicle Routing Problems With Time Windows

Top Venues

Eur. J. Oper. Res.

Discret. Appl. Math.

Publications

Laura Lüke, Katrin Heßler, Stefan Irnich
The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies. OR Spectr. 46 (3) (2024)
Jeanette Schmidt, Christian Tilk, Stefan Irnich
Using public transport in a 2-echelon last-mile delivery network. Eur. J. Oper. Res. 317 (3) (2024)
Jean Bertrand Gauthier, Stefan Irnich
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. Discret. Appl. Math. 346 (2024)
Nicola Bianchessi, Timo Gschwind, Stefan Irnich
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS J. Comput. 36 (1) (2024)
Katrin Heßler, Stefan Irnich
Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem. INFORMS J. Comput. 35 (1) (2023)
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Katharina Olkis, Olivier Péton
A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. Eur. J. Oper. Res. 305 (1) (2023)
Laura Korbacher, Stefan Irnich, John Martinovic, Nico Strasdat
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model. Discret. Appl. Math. 334 (2023)
Katrin Heßler, Stefan Irnich
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing. Oper. Res. Lett. 50 (2) (2022)
Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy
Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR Spectr. 44 (2) (2022)
Jeanette Schmidt, Stefan Irnich
New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem. EURO J. Comput. Optim. 10 (2022)
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Olivier Péton
Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO J. Transp. Logist. 10 (2021)
Nicola Bianchessi, Stefan Irnich, Christian Tilk
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288 (2021)
Christian Tilk, Katharina Olkis, Stefan Irnich
The last-mile vehicle routing problem with delivery options. OR Spectr. 43 (4) (2021)
Timo Hintsch, Stefan Irnich, Lone Kiilerich
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem. Transp. Sci. 55 (3) (2021)
Katrin Heßler, Stefan Irnich
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. Discret. Appl. Math. 288 (2021)
Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput. 33 (3) (2021)
Timo Hintsch, Stefan Irnich
Exact solution of the soft-clustered vehicle-routing problem. Eur. J. Oper. Res. 280 (1) (2020)
Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. J. Sched. 23 (3) (2020)
Konrad Steiner, Stefan Irnich
Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks. Transp. Sci. 54 (6) (2020)
Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider
Routing electric vehicles with a single recharge per route. Networks 76 (2) (2020)
Guy Desaulniers, Timo Gschwind, Stefan Irnich
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models. Transp. Sci. 54 (5) (2020)
Qie He, Stefan Irnich, Yongjia Song
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs. Transp. Sci. 53 (5) (2019)
Timo Gschwind, Nicola Bianchessi, Stefan Irnich
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur. J. Oper. Res. 278 (1) (2019)
David Sayah, Stefan Irnich
Optimal booking control in revenue management with two substitutable resources. Math. Methods Oper. Res. 89 (2) (2019)
Nicola Bianchessi, Michael Drexl, Stefan Irnich
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. Transp. Sci. 53 (4) (2019)
Christian Tilk, Michael Drexl, Stefan Irnich
Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. Eur. J. Oper. Res. 276 (2) (2019)
Nicola Bianchessi, Stefan Irnich
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. Transp. Sci. 53 (2) (2019)
Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. Transp. Sci. 52 (2) (2018)
Konrad Steiner, Stefan Irnich
Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut. Transp. Sci. 52 (4) (2018)
Katrin Heßler, Timo Gschwind, Stefan Irnich
Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271 (2) (2018)
Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 266 (2) (2018)
Timo Gschwind, Stefan Irnich, Isabel Podlinski
Maximum weight relaxed cliques and Russian Doll Search revisited. Discret. Appl. Math. 234 (2018)
Christian Tilk, Stefan Irnich
Combined column-and-row-generation for the optimal communication spanning tree problem. Comput. Oper. Res. 93 (2018)
Timo Hintsch, Stefan Irnich
Large multiple neighborhood search for the clustered vehicle-routing problem. Eur. J. Oper. Res. 270 (1) (2018)
Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows. Transp. Sci. 52 (5) (2018)
Christian Tilk, Stefan Irnich
Dynamic Programming for the Minimum Tour Duration Problem. Transp. Sci. 51 (2) (2017)
Timo Gschwind, Stefan Irnich
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities. OR Spectr. 39 (2) (2017)
Asvin Goel, Stefan Irnich
An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems. Transp. Sci. 51 (2) (2017)
David Sayah, Stefan Irnich
A new compact formulation for the discrete p-dispersion problem. Eur. J. Oper. Res. 256 (1) (2017)
Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur. J. Oper. Res. 261 (2) (2017)
Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250 (3) (2016)
Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. Oper. Res. 64 (6) (2016)
Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich
Branch-and-price-and-cut for a service network design and hub location problem. Eur. J. Oper. Res. 255 (3) (2016)
Timo Gschwind, Stefan Irnich
Dual Inequalities for Stabilized Column Generation Revisited. INFORMS J. Comput. 28 (1) (2016)
Timo Gschwind, Stefan Irnich
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. Transp. Sci. 49 (2) (2015)
Stefan Irnich, Demetrio Laganà, Claudia Schlebusch, Francesca Vocaturo
Two-phase branch-and-cut for the mixed capacitated general routing problem. Eur. J. Oper. Res. 243 (1) (2015)
Claudia Bode, Stefan Irnich
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem. Transp. Sci. 49 (2) (2015)
Michael Drexl, Stefan Irnich
Solving elementary shortest-path problems as mixed-integer programs. OR Spectr. 36 (2) (2014)
Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21 (3) (2014)
Claudia Bode, Stefan Irnich
The shortest-path problem with resource constraints with (k, 2)-loop elimination and its application to the capacitated arc-routing problem. Eur. J. Oper. Res. 238 (2) (2014)
Claudia Schlebusch, Stefan Irnich
Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem. OR (2014)
Claudia Bode, Stefan Irnich
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem. Oper. Res. 60 (5) (2012)
Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, Stefan Irnich
Heuristics for a Real-World Mail Delivery Problem. EvoApplications (2) (2011)
Timo Gschwind, Stefan Irnich
A note on symmetry reduction for circular traveling tournament problems. Eur. J. Oper. Res. 210 (2) (2011)
Stefan Irnich
A new branch-and-price algorithm for the traveling tournament problem. Eur. J. Oper. Res. 204 (2) (2010)
Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. INFORMS J. Comput. 22 (2) (2010)
Stefan Irnich
New Models and Methods for Arc Routing. Models and Algorithms for Optimization in Logistics (2009)
Stefan Irnich
Resource extension functions: properties, inversion, and generalization to segments. OR Spectr. 30 (1) (2008)
Stefan Irnich
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics. INFORMS J. Comput. 20 (2) (2008)
Stefan Irnich
Solution of real-world postman problems. Eur. J. Oper. Res. 190 (1) (2008)
Stefan Irnich
Undirected postman problems with zigzagging option: A cutting-plane approach. Comput. Oper. Res. 35 (12) (2008)
Stefan Irnich, Birger Funke, Tore Grünert
Sequential search and its application to vehicle-routing problems. Comput. Oper. Res. 33 (2006)
Stefan Irnich, Daniel Villeneuve
3. INFORMS J. Comput. 18 (3) (2006)
Birger Funke, Tore Grünert, Stefan Irnich
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration. J. Heuristics 11 (4) (2005)
Birger Funke, Tore Grünert, Stefan Irnich
A Note on Single Alternating Cycle Neighborhoods for the TSP. J. Heuristics 11 (2) (2005)
Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst
-partite graphs, an application in textile engineering. Comput. Oper. Res. 29 (1) (2002)
Stefan Irnich
A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur. J. Oper. Res. 122 (2) (2000)