Stefan Irnich

发表

Finding all k-cliques in k-partite graphs, an application in textile engineering

Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, 2002, Comput. Oper. Res..

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

Stefan Irnich, Claudia Bode, Stefan Irnich, 2014, Eur. J. Oper. Res..

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

Stefan Irnich, Timo Gschwind, Christian Tilk, 2017, Eur. J. Oper. Res..

Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hubflugproblem

Stefan Irnich, Hans-Jürgen Sebastian, H. Sebastian, 2002 .

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

Stefan Irnich, Nicola Bianchessi, Stefan Irnich, 2019, Transp. Sci..

The Family of Vehicle Routing Problems

Paolo Toth, Daniele Vigo, Stefan Irnich, 2014, Vehicle Routing.

An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems

Stefan Irnich, Asvin Goel, Stefan Irnich, 2014, Transp. Sci..

Chapter 9: The Capacitated Arc Routing Problem: Exact Algorithms

Stefan Irnich, Enrique Benavent, Jose M. Belenguer, 2013 .

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

Stefan Irnich, Konrad Steiner, 2018, Transp. Sci..

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

Tore Grünert, Stefan Irnich, Birger Funke, 2005, J. Heuristics.

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

Demetrio Laganà, Francesca Vocaturo, Stefan Irnich, 2015, Eur. J. Oper. Res..

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

Stefan Irnich, Claudia Bode, 2012, Oper. Res..

Vehicle Routing Problems with Inter-Tour Resource Constraints

Stefan Irnich, Christoph Hempsch, Stefan Irnich, 2008 .

Shortest Path Problems with Resource Constraints

Stefan Irnich, Guy Desaulniers, Stefan Irnich, 2005 .

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

Stefan Irnich, Stefan Irnich, 2000, Eur. J. Oper. Res..

Large multiple neighborhood search for the clustered vehicle-routing problem

Stefan Irnich, Timo Hintsch, Stefan Irnich, 2018, Eur. J. Oper. Res..

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

Stefan Irnich, Timo Gschwind, Stefan Irnich, 2015, Transp. Sci..

Solving elementary shortest-path problems as mixed-integer programs

Stefan Irnich, Michael Drexl, Stefan Irnich, 2014, OR Spectr..

A Note on Single Alternating Cycle Neighborhoods for the TSP

Tore Grünert, Stefan Irnich, Birger Funke, 2005, J. Heuristics.

Dynamic Programming for the Minimum Tour Duration Problem

Stefan Irnich, Christian Tilk, Stefan Irnich, 2017, Transp. Sci..

A new compact formulation for the discrete p-dispersion problem

Stefan Irnich, David Sayah, Stefan Irnich, 2017, Eur. J. Oper. Res..

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

Stefan Irnich, Christian Tilk, 2018, Comput. Oper. Res..

Optimization Models and Methods for Node-routing and Arc-Routing Problems : Contributions to Enhancements of Efficiency and Generality

Stefan Irnich, 2007 .

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows

Stefan Irnich, Guy Desaulniers, Fausto Errico, 2014, Oper. Res..

Branch-price-and-cut algorithms for electric vehicle-routing Problems with time Windows

Stefan Irnich, Guy Desaulniers, Fausto Errico, 2015 .

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

Stefan Irnich, Claudia Bode, 2015, Transp. Sci..

Maximum weight relaxed cliques and Russian Doll Search revisited

Stefan Irnich, Timo Gschwind, Isabel Podlinski, 2018, Discret. Appl. Math..

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

Stefan Irnich, Ann-Kathrin Rothenbächer, Michael Drexl, 2016, Eur. J. Oper. Res..

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

Stefan Irnich, Ann-Kathrin Rothenbächer, Michael Drexl, 2018, Transp. Sci..

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

Stefan Irnich, Timo Gschwind, Christian Tilk, 2020, J. Sched..

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

Stefan Irnich, Guy Desaulniers, Timo Gschwind, 2019, Transp. Sci..

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

Stefan Irnich, Stefan Irnich, 2008, INFORMS J. Comput..

Dual Inequalities for Stabilized Column Generation Revisited

Stefan Irnich, Timo Gschwind, Stefan Irnich, 2016, INFORMS J. Comput..

Large neighborhood search heuristic with exact components for generalized vehicle routing problems with time windows

Stefan Irnich, Fabien Lehuédé, Olivier Péton, 2020 .

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

Stefan Irnich, Timo Hintsch, Lone Kiilerich, 2019, Transp. Sci..

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

Stefan Irnich, Christian Tilk, Michael Drexl, 2017, Transp. Sci..

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

Stefan Irnich, Timo Gschwind, Christian Tilk, 2018, Eur. J. Oper. Res..

Exact solution of the soft-clustered vehicle-routing problem

Stefan Irnich, Timo Hintsch, Stefan Irnich, 2020, Eur. J. Oper. Res..

Sequential search and its application to vehicle-routing problems

Tore Grünert, Stefan Irnich, Birger Funke, 2006, Comput. Oper. Res..

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

Stefan Irnich, Claudia Schlebusch, 2014, OR.

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

Stefan Irnich, Yongjia Song, Qie He, 2019, Transp. Sci..

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

Stefan Irnich, Timo Gschwind, Stefan Irnich, 2017, OR Spectr..

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

Stefan Irnich, Christian Tilk, Nicola Bianchessi, 2021, Discret. Appl. Math..

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

Stefan Irnich, Gilbert Laporte, Guy Desaulniers, 2015, Eur. J. Oper. Res..

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

Stefan Irnich, 2008, OR Spectr..

Heuristics for a Real-World Mail Delivery Problem

Stefan Irnich, Richard F. Hartl, Karl F. Doerner, 2011, EvoApplications.

Optimal booking control in revenue management with two substitutable resources

Stefan Irnich, David Sayah, 2019, Math. Methods Oper. Res..

Optimierung im Transport

Tore Grünert, Stefan Irnich, 2005 .

The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3

Stefan Irnich, Daniel Villeneuve, Stefan Irnich, 2006, INFORMS J. Comput..

Path Reduced Costs for Eliminating Arcs

Stefan Irnich, Jacques Desrosiers, Guy Desaulniers, 2007 .

Formulations for an inventory routing problem

Stefan Irnich, Maria Grazia Speranza, Claudia Archetti, 2014, Int. Trans. Oper. Res..

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

Stefan Irnich, Stefan Irnich, 2010, Eur. J. Oper. Res..

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

Stefan Irnich, Konrad Steiner, Stefan Irnich, 2020, Transp. Sci..

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

Stefan Irnich, Timo Gschwind, Nicola Bianchessi, 2019, Eur. J. Oper. Res..

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

Stefan Irnich, Christian Tilk, Michael Drexl, 2019, Eur. J. Oper. Res..

A note on symmetry reduction for circular traveling tournament problems

Stefan Irnich, Timo Gschwind, Stefan Irnich, 2011, Eur. J. Oper. Res..

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

Stefan Irnich, Frank Meisel, Christian Tilk, 2015 .

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

Stefan Irnich, Michael Drexl, Nicola Bianchessi, 2019, Transp. Sci..

Routing electric vehicles with a single recharge per route

Stefan Irnich, Guy Desaulniers, Michael Schneider, 2020, Networks.

The Shortest Path Problem with k-Cycle Elimination (k 3): Improving Branch and Price Algorithms for Vehicle Routing and Scheduling

Stefan Irnich, Daniel Villeneuve, 2000 .

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

Stefan Irnich, Katrin Heßler, Stefan Irnich, 2021, Discret. Appl. Math..

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

Stefan Irnich, 2008, Comput. Oper. Res..

Stabilized branch-and-price algorithms for vector packing problems

Stefan Irnich, Timo Gschwind, Katrin Heßler, 2018, Eur. J. Oper. Res..

New Models and Methods for Arc Routing

Stefan Irnich, Stefan Irnich, 2009, Models and Algorithms for Optimization in Logistics.

Solution of real-world postman problems

Stefan Irnich, 2008, Eur. J. Oper. Res..

The Last-mile Vehicle Routing Problem with Delivery Options

Stefan Irnich, Christian Tilk, Katharina Olkis, 2020 .

A Note on Postman Problems with Zigzag Service

Stefan Irnich, 2005 .

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling

Stefan Irnich, Jacques Desrosiers, Guy Desaulniers, 2010, INFORMS J. Comput..

Four Variants of the Vehicle Routing Problem

Daniele Vigo, Stefan Irnich, Michael Schneider, 2014, Vehicle Routing.

Chapter 2 SHORTEST PATH PROBLEMS WITH RESOURCE CONSTRAINTS

Stefan Irnich, Guy Desaulniers, 2017 .

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

Stefan Irnich, Fabio Furini, Timo Gschwind, 2020, INFORMS J. Comput..

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

Stefan Irnich, Ulrich Pferschy, Katrin Heßler, 2021, OR Spectrum.

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

Stefan Irnich, Fabien Lehuédé, Olivier Péton, 2021, EURO J. Transp. Logist..

Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing

Stefan Irnich, Timo Gschwind, Timo Gschwinda, 2012 .

Cliques in K-partite Graphs and Their Application in Textile Engineering

Stefan Irnich, Markus Schneider, Stefan Irnich, 1998 .