Stefan Irnich

发表

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling

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

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

Stefan Irnich, Michael Drexl, F. Meisel, 2015 .

Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques

Stefan Irnich, R. W. Calvo, Fabio Furini, 2015 .

Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System

Stefan Irnich, Ulrich Pferschy, Katrin Heßler, 2020 .

Inter-Depot Moves and Dynamic-Radius Search for Multi-Depot Vehicle Routing Problems

Stefan Irnich, J. B. Gauthier, Stefan Irnicha, 2020 .

Asymmetry Helps: Dynamic Half-Way Points for Solving Shortest Path Problems with Resource Constraints Faster

Stefan Irnich, Christian Tilk, Timo Gschwind, 2016 .

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

Stefan Irnich, Olivier Péton, Christian Tilk, 2022, Eur. J. Oper. Res..

A New Compact Formulation for Discrete p-Dispersion

Stefan Irnich, D. Sayah, 2015 .

Solving elementary shortest-path problems as mixed-integer programs

Stefan Irnich, Michael Drexl, 2012, OR Spectrum.

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

Stefan Irnich, Katrin Heßler, 2022, INFORMS Journal on Computing.

Using Public Transport in a 2-Echelon Last-Mile Delivery Network

Stefan Irnich, Christian Tilk, J. Schmidt, 2022, European Journal of Operational Research.

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

Stefan Irnich, Christian Tilk, Timo Gschwind, 2019, Journal of Scheduling.

Strategic Planning for Integrated

Stefan Irnich, Stefan Irnicha, K. Steiner, 2018 .

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

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

Maximum weight relaxed cliques and Russian Doll Search revisited

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

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.

Routing electric vehicles with a single recharge per route

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

Shortest Path Problems with Resource Constraints

Stefan Irnich, Guy Desaulniers, Stefan Irnich, 2005 .

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows

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

Four Variants of the Vehicle Routing Problem

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

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

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

The Family of Vehicle Routing Problems

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

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

Stefan Irnich, Olivier Péton, Christian Tilk, 2021, EURO J. Transp. Logist..

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..

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

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

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

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

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

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

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..

Dynamic Programming for the Minimum Tour Duration Problem

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

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..

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

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

Exact solution of the soft-clustered vehicle-routing problem

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

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..

Formulations for an inventory routing problem

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

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..

Stabilized branch-and-price algorithms for vector packing problems

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

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

Stefan Irnich, Stefan Irnich, 2000, Eur. J. 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..

An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems

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

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

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

Large multiple neighborhood search for the clustered vehicle-routing problem

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

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

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

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..

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

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

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..

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

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

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

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

A new compact formulation for the discrete p-dispersion problem

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

Sequential search and its application to vehicle-routing problems

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

Rule-based design of a granular tabu search for the multi-depot vehicle routing problem

Stefan Irnich, Michael Schneider, Rossana Cavagnini, 2021 .

New Models and Methods for Arc Routing

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

A Note on Single Alternating Cycle Neighborhoods for the TSP

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

Vehicle Routing Problems with Inter-Tour Resource Constraints

Stefan Irnich, Christoph Hempsch, Stefan Irnich, 2008 .

Solving elementary shortest-path problems as mixed-integer programs

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

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

Jeanette P. Schmidt, Stefan Irnich, 2022, EURO J. Comput. Optim..

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..

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

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

A note on symmetry reduction for circular traveling tournament problems

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

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

Stefan Irnich, Stefan Irnich, 2010, 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..

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..

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

Stefan Irnich, Markus Schneider, Stefan Irnich, 1998 .

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..