Stefan Irnich

According to our database, Stefan Irnich authored at least 69 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff.

Stefan Faldum, Sarah Machate, Timo Gschwind, Stefan Irnich

OR Spectr., December, 2024

The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies.

Laura Lüke, Katrin Heßler, Stefan Irnich

OR Spectr., September, 2024

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.

Nicola Bianchessi, Timo Gschwind, Stefan Irnich

INFORMS J. Comput., 2024

Using public transport in a 2-echelon last-mile delivery network.

Jeanette Schmidt, Christian Tilk, Stefan Irnich

Eur. J. Oper. Res., 2024

Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems.

Jean Bertrand Gauthier, Stefan Irnich

Discret. Appl. Math., 2024

2023

Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model.

Laura Korbacher, Stefan Irnich, John Martinovic, Nico Strasdat

Discret. Appl. Math., July, 2023

Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem.

Katrin Heßler, Stefan Irnich

INFORMS J. Comput., 2023

A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows.

Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Katharina Olkis, Olivier Péton

Eur. J. Oper. Res., 2023

2022

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system.

Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy

OR Spectr., 2022

A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing.

Katrin Heßler, Stefan Irnich

Oper. Res. Lett., 2022

New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem.

Jeanette Schmidt, Stefan Irnich

EURO J. Comput. Optim., 2022

2021

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem.

Timo Hintsch, Stefan Irnich, Lone Kiilerich

Transp. Sci., 2021

The last-mile vehicle routing problem with delivery options.

Christian Tilk, Katharina Olkis, Stefan Irnich

OR Spectr., 2021

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.

Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo

INFORMS J. Comput., 2021

Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows.

Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Olivier Péton

EURO J. Transp. Logist., 2021

A branch-and-cut algorithm for the soft-clustered vehicle-routing problem.

Katrin Heßler, Stefan Irnich

Discret. Appl. Math., 2021

A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.

Nicola Bianchessi, Stefan Irnich, Christian Tilk

Discret. Appl. Math., 2021

2020

Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks.

Konrad Steiner, Stefan Irnich

Transp. Sci., 2020

Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models.

Guy Desaulniers, Timo Gschwind, Stefan Irnich

Transp. Sci., 2020

Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network.

Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde

J. Sched., 2020

Routing electric vehicles with a single recharge per route.

Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider

Networks, 2020

Exact solution of the soft-clustered vehicle-routing problem.

Timo Hintsch, Stefan Irnich

Eur. J. Oper. Res., 2020

2019

Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs.

Qie He, Stefan Irnich, Yongjia Song

Transp. Sci., 2019

Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows.

Nicola Bianchessi, Stefan Irnich

Transp. Sci., 2019

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints.

Nicola Bianchessi, Michael Drexl, Stefan Irnich

Transp. Sci., 2019

Optimal booking control in revenue management with two substitutable resources.

David Sayah, Stefan Irnich

Math. Methods Oper. Res., 2019

Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies.

Christian Tilk, Michael Drexl, Stefan Irnich

Eur. J. Oper. Res., 2019

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.

Timo Gschwind, Nicola Bianchessi, Stefan Irnich

Eur. J. Oper. Res., 2019

2018

Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem.

Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel

Transp. Sci., 2018

Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut.

Konrad Steiner, Stefan Irnich

Transp. Sci., 2018

Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows.

Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich

Transp. Sci., 2018

Large multiple neighborhood search for the clustered vehicle-routing problem.

Timo Hintsch, Stefan Irnich

Eur. J. Oper. Res., 2018

Stabilized branch-and-price algorithms for vector packing problems.

Katrin Heßler, Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2018

Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems.

Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk

Eur. J. Oper. Res., 2018

Maximum weight relaxed cliques and Russian Doll Search revisited.

Timo Gschwind, Stefan Irnich, Isabel Podlinski

Discret. Appl. Math., 2018

Combined column-and-row-generation for the optimal communication spanning tree problem.

Christian Tilk, Stefan Irnich

Comput. Oper. Res., 2018

2017

Dynamic Programming for the Minimum Tour Duration Problem.

Christian Tilk, Stefan Irnich

Transp. Sci., 2017

An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems.

Asvin Goel, Stefan Irnich

Transp. Sci., 2017

Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities.

Timo Gschwind, Stefan Irnich

OR Spectr., 2017

Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster.

Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2017

A new compact formulation for the discrete p-dispersion problem.

David Sayah, Stefan Irnich

Eur. J. Oper. Res., 2017

2016

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows.

Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider

Oper. Res., 2016

Dual Inequalities for Stabilized Column Generation Revisited.

Timo Gschwind, Stefan Irnich

INFORMS J. Comput., 2016

Branch-and-price-and-cut for a service network design and hub location problem.

Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich

Eur. J. Oper. Res., 2016

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.

Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte

Eur. J. Oper. Res., 2016

2015

Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem.

Timo Gschwind, Stefan Irnich

Transp. Sci., 2015

In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem.

Claudia Bode, Stefan Irnich

Transp. Sci., 2015

Two-phase branch-and-cut for the mixed capacitated general routing problem.

Stefan Irnich, Demetrio Laganà, Claudia Schlebusch, Francesca Vocaturo

Eur. J. Oper. Res., 2015

2014

Solving elementary shortest-path problems as mixed-integer programs.

Michael Drexl, Stefan Irnich

OR Spectr., 2014

Formulations for an inventory routing problem.

Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza

Int. Trans. Oper. Res., 2014

The shortest-path problem with resource constraints with (k, 2)-loop elimination and its application to the capacitated arc-routing problem.

Claudia Bode, Stefan Irnich

Eur. J. Oper. Res., 2014

The Family of Vehicle Routing Problems.

Stefan Irnich, Paolo Toth, Daniele Vigo

Proceedings of the Vehicle Routing, 2014

Four Variants of the Vehicle Routing Problem.

Stefan Irnich, Michael Schneider, Daniele Vigo

Proceedings of the Vehicle Routing, 2014

2012

Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem.

Claudia Bode, Stefan Irnich

Oper. Res., 2012

2011

A note on symmetry reduction for circular traveling tournament problems.

Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2011

Heuristics for a Real-World Mail Delivery Problem.

Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, Stefan Irnich

Proceedings of the Applications of Evolutionary Computation, 2011

2010

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.

Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar

INFORMS J. Comput., 2010

A new branch-and-price algorithm for the traveling tournament problem.

Stefan Irnich

Eur. J. Oper. Res., 2010

2009

New Models and Methods for Arc Routing.

Stefan Irnich

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008

Resource extension functions: properties, inversion, and generalization to segments.

Stefan Irnich

OR Spectr., 2008

A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics.

Stefan Irnich

INFORMS J. Comput., 2008

Solution of real-world postman problems.

Stefan Irnich

Eur. J. Oper. Res., 2008

Undirected postman problems with zigzagging option: A cutting-plane approach.

Stefan Irnich

Comput. Oper. Res., 2008

2006

The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> 3.

Stefan Irnich, Daniel Villeneuve

INFORMS J. Comput., 2006

Sequential search and its application to vehicle-routing problems.

Stefan Irnich, Birger Funke, Tore Grünert

Comput. Oper. Res., 2006

2005

Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration.

Birger Funke, Tore Grünert, Stefan Irnich

J. Heuristics, 2005

A Note on Single Alternating Cycle Neighborhoods for the TSP.

Birger Funke, Tore Grünert, Stefan Irnich

J. Heuristics, 2005

2002

Finding all <i>k</i>-cliques in <i>k</i>-partite graphs, an application in textile engineering.

Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst

Comput. Oper. Res., 2002

2000

A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles.

Stefan Irnich

Eur. J. Oper. Res., 2000