Stefan Irnich

76 papers B 1Journal 70Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
A linear-size model for the single picker routing problem with scattered storage.
Eur. J. Oper. Res.
Laura Lüke, André Hessenius, Stefan Irnich
2026 J jnl
Rule-based design of a granular tabu search for the multi-depot vehicle routing problem.
Ann. Oper. Res.
Christian Becker, Rossana Cavagnini, Stefan Irnich, Michael Schneider
2026 J jnl
Subset-Row Inequalities and Unreachability in Path-Based Formulations for Vehicle Routing and Scheduling Problems.
Networks
Stefan Faldum, Timo Gschwind, Stefan Irnich
2025 B conf
A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees.
SEA
Luzie Marianczuk, Ernst Althaus, Stefan Irnich, Marc E. Pfetsch
2025 J jnl
On Combining Conventional Point-To-Point and Automated Waste Collection Systems.
Networks
Maryam Dehghan Chenary, Richard F. Hartl, Stefan Irnich, Christian Tilk
2024 J jnl
Exact Solution of the Single-Picker Routing Problem with Scattered Storage.
INFORMS J. Comput.
Katrin Heßler, Stefan Irnich
2024 J jnl
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems.
Discret. Appl. Math.
Jean Bertrand Gauthier, Stefan Irnich
2024 J jnl
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.
INFORMS J. Comput.
Nicola Bianchessi, Timo Gschwind, Stefan Irnich
2024 J jnl
The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies.
OR Spectr.
Laura Lüke, Katrin Heßler, Stefan Irnich
2024 J jnl
Using public transport in a 2-echelon last-mile delivery network.
Eur. J. Oper. Res.
Jeanette Schmidt, Christian Tilk, Stefan Irnich
2024 J jnl
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff.
OR Spectr.
Stefan Faldum, Sarah Machate, Timo Gschwind, Stefan Irnich
2023 J jnl
A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows.
Eur. J. Oper. Res.
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Katharina Olkis, Olivier Péton
2023 J jnl
Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem.
INFORMS J. Comput.
Katrin Heßler, Stefan Irnich
2023 J jnl
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model.
Discret. Appl. Math.
Laura Korbacher, Stefan Irnich, John Martinovic, Nico Strasdat
2022 J jnl
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing.
Oper. Res. Lett.
Katrin Heßler, Stefan Irnich
2022 J jnl
Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system.
OR Spectr.
Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy
2022 J jnl
New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem.
EURO J. Comput. Optim.
Jeanette Schmidt, Stefan Irnich
2021 J jnl
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.
INFORMS J. Comput.
Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo
2021 J jnl
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem.
Discret. Appl. Math.
Katrin Heßler, Stefan Irnich
2021 J jnl
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.
Discret. Appl. Math.
Nicola Bianchessi, Stefan Irnich, Christian Tilk
2021 J jnl
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem.
Transp. Sci.
Timo Hintsch, Stefan Irnich, Lone Kiilerich
2021 J jnl
Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows.
EURO J. Transp. Logist.
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Olivier Péton
2021 J jnl
The last-mile vehicle routing problem with delivery options.
OR Spectr.
Christian Tilk, Katharina Olkis, Stefan Irnich
2020 J jnl
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network.
J. Sched.
Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde
2020 J jnl
Exact solution of the soft-clustered vehicle-routing problem.
Eur. J. Oper. Res.
Timo Hintsch, Stefan Irnich
2020 J jnl
Routing electric vehicles with a single recharge per route.
Networks
Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider
2020 J jnl
Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks.
Transp. Sci.
Konrad Steiner, Stefan Irnich
2020 J jnl
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models.
Transp. Sci.
Guy Desaulniers, Timo Gschwind, Stefan Irnich
2019 J jnl
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows.
Transp. Sci.
Nicola Bianchessi, Stefan Irnich
2019 J jnl
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs.
Transp. Sci.
Qie He, Stefan Irnich, Yongjia Song
2019 J jnl
Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies.
Eur. J. Oper. Res.
Christian Tilk, Michael Drexl, Stefan Irnich
2019 J jnl
Optimal booking control in revenue management with two substitutable resources.
Math. Methods Oper. Res.
David Sayah, Stefan Irnich
2019 J jnl
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.
Eur. J. Oper. Res.
Timo Gschwind, Nicola Bianchessi, Stefan Irnich
2019 J jnl
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints.
Transp. Sci.
Nicola Bianchessi, Michael Drexl, Stefan Irnich
2018 J jnl
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems.
Eur. J. Oper. Res.
Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk
2018 J jnl
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem.
Transp. Sci.
Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel
2018 J jnl
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows.
Transp. Sci.
Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich
2018 J jnl
Combined column-and-row-generation for the optimal communication spanning tree problem.
Comput. Oper. Res.
Christian Tilk, Stefan Irnich
2018 J jnl
Large multiple neighborhood search for the clustered vehicle-routing problem.
Eur. J. Oper. Res.
Timo Hintsch, Stefan Irnich
2018 J jnl
Maximum weight relaxed cliques and Russian Doll Search revisited.
Discret. Appl. Math.
Timo Gschwind, Stefan Irnich, Isabel Podlinski
2018 J jnl
Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut.
Transp. Sci.
Konrad Steiner, Stefan Irnich
2018 J jnl
Stabilized branch-and-price algorithms for vector packing problems.
Eur. J. Oper. Res.
Katrin Heßler, Timo Gschwind, Stefan Irnich
2017 J jnl
A new compact formulation for the discrete p-dispersion problem.
Eur. J. Oper. Res.
David Sayah, Stefan Irnich
2017 J jnl
An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems.
Transp. Sci.
Asvin Goel, Stefan Irnich
2017 J jnl
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster.
Eur. J. Oper. Res.
Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich
2017 J jnl
Dynamic Programming for the Minimum Tour Duration Problem.
Transp. Sci.
Christian Tilk, Stefan Irnich
2017 J jnl
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities.
OR Spectr.
Timo Gschwind, Stefan Irnich
2016 J jnl
Branch-and-price-and-cut for a service network design and hub location problem.
Eur. J. Oper. Res.
Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich
2016 J jnl
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.
Eur. J. Oper. Res.
Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte
2016 J jnl
Dual Inequalities for Stabilized Column Generation Revisited.
INFORMS J. Comput.
Timo Gschwind, Stefan Irnich
2016 J jnl
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows.
Oper. Res.
Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider
2015 J jnl
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem.
Transp. Sci.
Timo Gschwind, Stefan Irnich
2015 J jnl
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem.
Transp. Sci.
Claudia Bode, Stefan Irnich
2015 J jnl
Two-phase branch-and-cut for the mixed capacitated general routing problem.
Eur. J. Oper. Res.
Stefan Irnich, Demetrio Laganà, Claudia Schlebusch, Francesca Vocaturo
2014 — conf
Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem.
OR
Claudia Schlebusch, Stefan Irnich
2014 J jnl
Formulations for an inventory routing problem.
Int. Trans. Oper. Res.
Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza
2014 — ch.
Four Variants of the Vehicle Routing Problem.
Vehicle Routing
Stefan Irnich, Michael Schneider, Daniele Vigo
2014 J jnl
Solving elementary shortest-path problems as mixed-integer programs.
OR Spectr.
Michael Drexl, Stefan Irnich
2014 — ch.
The Family of Vehicle Routing Problems.
Vehicle Routing
Stefan Irnich, Paolo Toth, Daniele Vigo
2014 J jnl
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.
Claudia Bode, Stefan Irnich
2012 J jnl
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem.
Oper. Res.
Claudia Bode, Stefan Irnich
2011 J jnl
A note on symmetry reduction for circular traveling tournament problems.
Eur. J. Oper. Res.
Timo Gschwind, Stefan Irnich
2011 — conf
Heuristics for a Real-World Mail Delivery Problem.
EvoApplications (2)
Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, Stefan Irnich
2010 J jnl
A new branch-and-price algorithm for the traveling tournament problem.
Eur. J. Oper. Res.
Stefan Irnich
2010 J jnl
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.
INFORMS J. Comput.
Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar
2009 — conf
New Models and Methods for Arc Routing.
Models and Algorithms for Optimization in Logistics
Stefan Irnich
2008 J jnl
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics.
INFORMS J. Comput.
Stefan Irnich
2008 J jnl
Resource extension functions: properties, inversion, and generalization to segments.
OR Spectr.
Stefan Irnich
2008 J jnl
Solution of real-world postman problems.
Eur. J. Oper. Res.
Stefan Irnich
2008 J jnl
Undirected postman problems with zigzagging option: A cutting-plane approach.
Comput. Oper. Res.
Stefan Irnich
2006 J jnl
Sequential search and its application to vehicle-routing problems.
Comput. Oper. Res.
Stefan Irnich, Birger Funke, Tore Grünert
2006 J jnl
The Shortest-Path Problem with Resource Constraints and
INFORMS J. Comput.
Stefan Irnich, Daniel Villeneuve
2005 J jnl
A Note on Single Alternating Cycle Neighborhoods for the TSP.
J. Heuristics
Birger Funke, Tore Grünert, Stefan Irnich
2005 J jnl
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration.
J. Heuristics
Birger Funke, Tore Grünert, Stefan Irnich
2002 J jnl
Finding all
Comput. Oper. Res.
Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst
2000 J jnl
A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles.
Eur. J. Oper. Res.
Stefan Irnich