On Combining Conventional Point-To-Point and Automated Waste Collection Systems
Maryam DehghanChenary, Richard F. Hartl, Stefan Irnich, Christian Tilk
Working Paper Nov-2024-A, Department of Business Decisions and Analytics, University of Vienna, 2024.
link bibtex
The Vehicle Routing Problem with Drones and Time Windows: Minimizing Route Duration
Jeanette Schmidt
Technical Report LM-2024-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2024.
pdf bibtex
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
Technical Report LM-2024-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2024.
Forthcoming in: OR Spectrum
doi: 10.1007/s00291-024-00766-y (Open Access).
pdf
Subset-Row Inequalities and Unreachability in Path-based Formulations for Routing and Scheduling Problems
Stefan Faldum, Timo Gschwind, Stefan Irnich
Technical Report LM-2023-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2023.
pdf bibtex
Exact Solution of the Vehicle Routing Problem With Drones
Jeanette Schmidt, Christian Tilk, Stefan Irnich
Technical Report LM-2023-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2023.
Forthcoming in: Transportation Science
pdf
Exact Solution of the Single Picker Routing Problem with Scattered Storage
Katrin Heßler, Stefan Irnich
Technical Report LM-2023-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2023.
in: INFORMS Journal on Computing
doi: 10.1287/ijoc.2022.1255
pdf
The Single Picker Routing Problem with Scattered Storage: Modeling and Evaluation of Routing and Storage Policies
Laura Lüke, Katrin Heßler, Stefan Irnich
Technical Report LM-2023-01.R1, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2023.
in: OR Spectrum
doi: 10.1007/s00291-024-00760-4 (Open Access).
pdf
Resource-Window Reduction by Reduced Costs in Path-based Formulations for Routing and Scheduling Problems
Nicola Bianchessi, Timo Gschwind, Stefan Irnich
Technical Report LM-2022-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2022.
in: INFORMS Journal on Computing 36(1), 224–244, 2023.
doi: 10.1287/ijoc.2022.0214
pdf
Inter-Depot Moves and Dynamic-Radius Search for Multi-Depot Vehicle Routing Problems
Jean Bertrand Gauthier, Stefan Irnich
Technical Report LM-2022-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2022 (completely revised version of LM-2020-03).
in: Discrete Applied Mathematics 346, 2024.
doi: 10.1016/j.dam.2023.12.004 (Open Access).
pdf
Modeling and Exact Solution of Picker Routing and Order Batching Problems
Katrin Heßler, Stefan Irnich
Technical Report LM-2022-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2022.
pdf bibtex
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
Technical Report LM-2022-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2022.
in: Discrete Applied Mathematics 334, 145-162, 2023
doi: 10.1016/j.dam.2023.04.003
pdf
Using Public Transport in a 2-Echelon Last-Mile Delivery Network
Jeanette Schmidt, Christian Tilk, Stefan Irnich
Technical Report LM-2022-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2022.
in: European Journal of Operational Research, 2022
doi: 10.1016/j.ejor.2022.10.041
pdf
A Note on the Linearity of Ratliff and Rosenthal's Algorithm for Optimal Picker Routing
Katrin Heßler, Stefan Irnich
Technical Report LM-2021-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2021.
in: Operations Research Letters 50(2), 2022, 155-159.
doi: 10.1016/j.orl.2022.01.014
pdf
A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows.
Dorian Dumez, Christian Tilk, Stefan Irnich, Katharina Olkis, Fabien Lehuédé, and Olivier Péton
HAL archives-ouvertes.fr hal-03384261v1
in: European Journal of Operational Research, 2022.
doi: 10.1016/j.ejor.2022.05.022
pdf instances
Partial Dominance in Branch-Price-and-Cut for the Basic Multi-Compartment Vehicle-Routing Problem
Katrin Heßler, Stefan Irnich
Technical Report LM-2021-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2021.
in: INFORMS Journal on Computing 35(1), 50-65, 2023
doi: 10.1287/ijoc.2022.1255
pdf
Adapting the ng-path Relaxation for Bike Balancing Problems
Christian Tilk
Technical Report LM-2021-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2021.
in: Operations Research Letters 50(3), 241-245, 2022.
doi: 10.1016/j.orl.2022.02.0005
pdf
Rule-based design of a granular tabu search for the multi-depot vehicle routing problem
Christian Becker, Rosanna Cavagnini, Stefan Irnich, Michael Schneider.
Technical Report/Working Paper DPO-2021-01 Deutsche Post Chair – Optimization of Distribution Networks, RWTH Aachen University.
link bibtex
New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem
Jeanette Schmidt, Stefan Irnich
Technical Report LM-2020-07, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
in: EURO Journal on Computational Optimization.
doi: 10.1016/j.ejco.2022.100029
pdf
Hybridizing Large Neighborhood Search and Exact Methods for Generalized Vehicle Routing Problems with Time Windows
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, and Olivier Péton
HAL archives-ouvertes.fr hal-02935356
in: EURO Journal on Transportation and Logistics.
doi: 10.1016/j.ejtl.2021.100040 (Open Access).
pdf
The Last-mile Vehicle Routing Problem with Delivery Options
Christian Tilk, Katharina Olkis, Stefan Irnich
Technical Report LM-2020-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
in: OR Spectrum
doi: 10.1007/s00291-021-00633-0 (Open Access).
pdf
Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System
Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy
Technical Report LM-2020-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
in: OR Spectrum
doi: 10.1007/s00291-021-00628-x (Open Access).
pdf
Exact Algorithms for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes
Katrin Heßler
Technical Report LM-2020-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
in: European Journal of Operational Research 294(1), 2021, 188-205.
doi: 10.1016/j.ejor.2021.01.037.
pdf
In-depth analysis of granular local search for capacitated vehicle routing
Christian Schröder, Michael Schneider, Jean Bertrand Gauthier, Timo Gschwind
Working Paper DPO-2020-03, Deutsche Post Chair – Optimization of Distribution Networks, RWTH Aachen University.
in: Discrete Applied Mathematics 329, 2023, 61-86.
doi: 10.1016/j.dam.2022.12.019
pdf
The Pickup and Delivery Problem with Time Windows, Multiple Stacks, and Handling Operations
Marilène Cherkesly, Timo Gschwind
Les Cahiers du GERAD, G-2020-16.
in: European Journal of Operational Research
doi: 10.1016/j.ejor.2021.11.021
link
Inter-Depot Moves and Dynamic-Radius Search for Multi-Depot Vehicle Routing Problems
Jean Bertrand Gauthier, Stefan Irnich
Technical Report LM-2020-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
pdf bibtex
A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand
Nicola Bianchessi, Stefan Irnich, Christian Tilk
Technical Report LM-2020-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
in: Discrete Applied Mathematics, 288, 2021, 152-170.
doi: 10.1016/j.dam.2020.08.014
pdf
A Branch-and-Cut Algorithm for the Soft-Clustered Vehicle Routing Problem
Katrin Heßler, Stefan Irnich
Technical Report LM-2020-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2020.
in: Discrete Applied Mathematics, 288, 2021, 218–234.
doi: 10.1016/j.dam.2020.08.017
pdf
Branch-and-Cut for the Active-Passive Vehicle Routing Problem
Christian Tilk, Michael Forbes
Technical Report LM-2019-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2019.
pdf bibtex
Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
Christian Tilk, Asvin Goel
Technical Report LM-2019-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2019.
in: European Journal of Operational Research 283(1), 2020, 108-124.
doi: 10.1016/j.ejor.2019.10.038
pdf
Routing Electric Vehicles with a Single Recharge per Route
Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider
Working Paper DPO-2019-08, Deutsche Post Chair - Optimization of Distribution Networks, RWTH Aachen University, Aachen, 2019.
in: Networks 76(2), 2020, 187-205. (Open Access).
doi: 10.1002/net.21964
link
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
Timo Hintsch, Stefan Irnich, Lone Kiilerich
Technical Report LM-2019-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2019.
in: Transportation Science.
doi: 10.1287/trsc.2020.0988
pdf
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Guy Desaulniers, Timo Gschwind, Stefan Irnich
Les Cahiers du GERAD, G-2019-48.
in: Transportation Science 54(5), 2020, 1170-1188.
doi: 10.1287/trsc.2020.0988
link
Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem
Timo Hintsch
Technical Report LM-2019-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2019.
in: Computers & Operations Research 129, 2021, 105132.
doi: 10.1016/j.cor.2020.105132
pdf
Schedule-Based Integrated Inter-City Bus Line Planning for Multiple Timetabled Services via Large Multiple Neighborhood Search
Konrad Steiner
Technical Report LM-2018-09, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
pdf bibtex
On Testing Capacity Constraints in Pickup-and-Delivery Problems with Trailers in Amortized Constant Time
Michael Drexl
Technical Report LM-2018-08, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: 4OR, 2020 (Open Access).
doi: 10.1007/s10288-020-00452-z
pdf
Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks
Konrad Steiner, Stefan Irnich
Technical Report LM-2018-07, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: Transportation Science 54(6), 2020, 1616-1639.
doi: 10.1287/trsc.2020.0987
pdf
Stabilized Branch-Price-and-Cut for the Commodity-constrained Split Delivery Vehicle Routing Problem
Timo Gschwind, Nicola Bianchessi, Stefan Irnich
Technical Report LM-2018-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: European Journal of Operational Research 278(1), 2019, 91-104.
doi: 10.1016/j.ejor.2019.04.008
pdf
On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers
Michael Drexl
Technical Report LM-2018-05 (revised version), Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: Central European Journal of Operations Research, 2020 (Open Access).
doi: 10.1007/s10100-020-00690-w
pdf
Exact Solution of the Soft-Clustered Vehicle-Routing Problem
Timo Hintsch, Stefan Irnich
Technical Report LM-2018-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: European Journal of Operational Research 280(1), 2020, 164-178.
doi: 10.1016/j.ejor.2019.07.019
pdf
Branch-Cut-and-Price for Scheduling Deliveries with Time Windows in a Direct Shipping Network
Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde
Technical Report LM-2018-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: Journal of Scheduling 23(3), 2020, 363-377.
doi: 10.1007/s10951-019-00620-y
pdf
Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs
Qie He, Stefan Irnich, Yongjia Song
Technical Report LM-2018-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: Transportation Science
doi: 10.1287/trsc.2019.0891
pdf
Nested Branch-and-Price-and-Cut for Vehicle Routing Problems with Multiple Resource Interdependencies
Christian Tilk, Michael Drexl, Stefan Irnich
Technical Report LM-2018-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2018.
in: European Journal of Operational Research 276(2), 2019, 549-565.
doi: 10.1016/j.ejor.2019.01.041
pdf instances
Upper and Lower Bounds for the Vehicle-Routing Problem with Private Fleet and Common Carrier
Dominik Goeke, Timo Gschwind, Michael Schneider
Working Paper DPO-2017-08, Deutsche Post Chair – Optimization of Distribution Networks, RWTH Aachen University.
in: Discrete Applied Mathematics, 264, 2019, 43–61.
doi: 10.1016/j.dam.2018.10.015
pdf
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo
Technical Report LM-2017-07, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
in: INFORMS Journal on Computing.
doi: 10.1287/ijoc.2020.0984
pdf
Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo
Technical Report LM-2017-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
pdf bibtex
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
Ann-Kathrin Rothenbächer
Technical Report LM-2017-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
in: Transportation Science 53(3), 2019, 850-866.
doi: 10.1287/trsc.2018.0855
Stabilized Branch-and-Price Algorithms for Vector Packing Problems
Katrin Heßler, Timo Gschwind, Stefan Irnich
Technical Report LM-2017-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
in: European Journal of Operational Research 271(2), 2018, 401-419.
doi: 10.1016/j.ejor.2018.04.047
pdf
Bidirectional Labeling in Column-Generation Algorithms for Pickup-and-Delivery Problems
Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk
Technical Report LM-2017-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
in: European Journal of Operational Research 266(2), 2018, 521–530.
doi: 10.1016/j.ejor.2017.09.035
pdf
Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
Nicola Bianchessi, Michael Drexl, Stefan Irnich
Technical Report LM-2017-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
in: Transportation Science 53(4), 2019, 1067-1084.
doi: 10.1287/trsc.2018.0862
pdf
Large Multiple Neighborhood Search for the Clustered Vehicle-Routing Problem
Timo Hintsch, Stefan Irnich
Technical Report LM-2017-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2017.
in: European Journal of Operational Research 270(1), 2018, 118-131.
doi: 10.1016/j.ejor.2018.02.056
pdf
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
Timo Gschwind, Michael Drexl
Technical Report LM-2016-08, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: Transportation Science 53(2), 2019, 480-491.
doi:10.1287/trsc.2018.0837
pdf
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
Nicola Bianchessi, Stefan Irnich
Technical Report LM-2016-07, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: Transportation Science 53(2), 2019, 442-462.
doi: 10.1287/trsc.2018.0825
pdf
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich
Technical Report LM-2016-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: Transportation Science 52(5), 2018, 1174-1190.
doi: 10.1287/trsc.2017.0765
pdf
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
Technical Report LM-2016-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: European Journal of Operational Research 261(2), 2017, 530–539.
doi: 10.1016/j.ejor.2017.03.017
pdf
Branch-and-Price-and-Cut for the Vehicle Routing and Truck Driver Scheduling Problem
Christian Tilk
Technical Report LM-2016-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
pdf bibtex
Combined Column-and-Row-Generation for the Optimal Communication Spanning Tree Problem
Christian Tilk, Stefan Irnich
Technical Report LM-2016-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: Computers & Operations Research 93, 2018, 113-122.
doi: 10.1016/j.cor.2018.01.003
pdf
Schedule-based integrated inter-city bus line planning via branch-and-cut
Konrad Steiner, Stefan Irnich
Technical Report LM-2016-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: Transportation Science 52(4), 2018, 882-897.
doi: 10.1287/trsc.2017.0763
pdf
Optimal Booking Control in Airline Revenue Management with Two Flights and Flexible Products
David Sayah, Stefan Irnich
Technical Report LM-2016-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2016.
in: Mathematical Methods of Operations Research 89(2), 2019, 189–222.
doi: 10.1007/s00186-018-0646-0
pdf
Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo
Technical Report LM-2015-07, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
pdf bibtex
Approximate Linear Programming in Network Revenue Management with Multiple Modes
David Sayah
Technical Report LM-2015-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
pdf bibtex instances
A New Compact Formulation for Discrete p-Dispersion
David Sayah, Stefan Irnich
Technical Report LM-2015-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
in: European Journal of Operational Research 256(1), 2017, 62–67.
doi: 10.1016/j.ejor.2016.06.036
pdf
Branch-and-Price for the Active-Passive Vehicle-Routing Problem
Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel
Technical Report LM-2015-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
in: Transportation Science 52(2), 2018, 300-319.
doi: 10.1287/trsc.2016.0730
pdf
Branch-and-Price-and-Cut for a Service Network Design and Hub Location Problem
Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich
Technical Report LM-2015-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
in: European Journal of Operational Research 255(3), 2016, 935-947.
doi: 10.1016/j.ejor.2016.05.058
pdf
Maximum Weight Relaxed Cliques and Russian Doll Search Revisited
Timo Gschwind, Stefan Irnich, Isabel Podlinski
Technical Report LM-2015-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
in: Discrete Applied Mathematics 234, 2018, 131-138.
doi: 10.1016/j.dam.2016.09.039
pdf instances
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
Les Cahiers du GERAD, G-2015-25, Montréal, Canada, 2015.
in: European Journal of Operational Research 250(3), 2016, 782–793.
doi: 10.1016/j.ejor.2015.10.046
pdf link
Route Feasibility Testing and Forward Time Slack for the Synchronized Pickup and Delivery Problem
Timo Gschwind
Technical Report LM-2015-01 (revised), Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2015.
in OR Spectrum, 41(2), 491–512.
doi: 10.1007/s00291-018-0544-0
pdf
Exact algorithms for electric vehicle-routing problems with time windows
Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider
Les Cahiers du GERAD, G-2014-110, Montréal, Canada, 2014.
in: Operations Research 64(6), 2016,1388-1405.
doi:10.1287/opre.2016.1535
pdf link
Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities
Timo Gschwind, Stefan Irnich
Technical Report LM-2014-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2014.
in: OR Spectrum 39(2), 2017, 541-556.
doi: 10.1007/s00291-016-0463-x
pdf
A Generic Heuristic for Vehicle Routing Problems with Multiple Synchronization Constraints
Michael Drexl
Technical Report LM-2014-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2014.
pdf bibtex
An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems
Asvin Goel, Stefan Irnich
Technical Report No. 33, Jacobs University, School of Engineering and Science, 2014.
in: Transportation Science 51(2), 2017, 737-754.
doi: 10.1287/trsc.2016.0678
link
Dynamic Programming for the Minimum Tour Duration Problem
Christian Tilk, Stefan Irnich
Technical Report LM-2014-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2014.
in: Transportation Science 51(2), 2017, 549-565.
doi: 10.1287/trsc.2015.0626
pdf
Dual Inequalities for Stabilized Column Generation Revisited
Timo Gschwind, Stefan Irnich
Technical Report LM-2014-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2014.
in: INFORMS Journal on Computing 28(1), 2016, 175-194
doi: 10.1287/ijoc.2015.0670
pdf instances
Two-Phase Branch-and-Cut for the Mixed Capacitated General Routing Problem
Claudia Bode, Stefan Irnich, Demetrio Laganà, Francesca Vocaturo
Technical Report LM-2014-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2014.
in: European Journal of Operational Research 243(1), 2015, 17-29.
doi: 10.1016/j.ejor.2014.11.005
pdf
A Comparison of Column-Generation Approaches to the Synchronized Pickup and Delivery Problem
Timo Gschwind
Technical Report LM-2014-01 (revised), Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2014.
in: European Journal of Operational Research 247(1), 2015, 60-71
doi: 10.1016/j.ejor.2015.06.017
pdf instances
Solving Static and Dynamic Seat Allocation Models with Two Substitutable Resources
David Sayah, Stefan Irnich
Technical Report LM-2013-04 (under revision), Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2013.
pdf bibtex
The Family of Vehicle Routing Problems
Stefan Irnich, Paolo Toth, Daniele Vigo
in: Paolo Toth and Daniele Vigo (eds.), Vehicle Routing: Problems, Methods, and Applications, Second Edition, MOS-SIAM Series on Optimization, SIAM, Philadelphia, 2014. Chapter 1, pages 1-33.
doi: 10.1137/1.9781611973594.ch1
Four Variants of the Vehicle Routing Problem
Stefan Irnich, Michael Schneider, Daniele Vigo
in: Paolo Toth and Daniele Vigo (eds.), Vehicle Routing: Problems, Methods, and Applications, Second Edition, MOS-SIAM Series on Optimization, SIAM, Philadelphia, 2014. Chapter 9, pages 241-271.
doi: 10.1137/1.9781611973594.ch9
The Capacitated Arc-Routing Problem: Exact Methods
José Manuel Belenguer, Enrique Benavent, Stefan Irnich
in: Ángel Corberán and Gilbert Laporte (eds.), Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization, SIAM, Philadelphia, 2014. Chapter 9, pages 183-221.
doi: 10.1137/1.9781611973679.ch9
A survey of variants and extensions of the location-routing problem
Michael Drexl, Michael Schneider.
in: European Journal of Operational Research 241(2), 2015, 283-308.
doi: 10.1016/j.ejor.2014.08.030
A Survey of Location-Routing Problems
Michael Drexl, Michael Schneider
Technical Report LM-2013-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2013.
pdf bibtex
Formulations for an inventory routing problem
Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza
Technical Report WPDEM 14, Department of Economics and Management, University Brescia, Italy, 2013
in: International Transactions in Operations Research 21(3), 2014, 353-374.
doi: 10.1111/itor.12076
link
Lower Bounds for Park and Loop Delivery Problems
Claudia Bode
Technical Report LM-2013-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2013.
pdf bibtex
The Shortest-Path Problem with Resource Constraints with (k, 2)-Loop Elimination and Its Application to the Capacitated Arc-Routing Problem
Claudia Bode and Stefan Irnich
Technical Report LM-2013-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2013.
in: European Journal of Operational Research 238(2), 2014, 415–426.
doi: 10.1016/j.ejor.2014.04.004
pdf
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem
Claudia Bode and Stefan Irnich
Technical Report LM-2012-06 (revised), Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2012.
in: Transportation Science 49(2), 2015, 369-383.
doi:10.1287/trsc.2013.0507
pdf
Effective Handling of Dynamic Time Windows and its Application to Solving the Dial-a-Ride Problem
Timo Gschwind and Stefan Irnich
Technical Report LM-2012-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2012.
in: Transportation Science 49(2), 2015, 335-354.
doi: 10.1287/trsc.2014.0531
pdf
Branch-and-Cut Algorithms for the Vehicle Routing Problem with Trailers and Transshipments
Michael Drexl
Technical Report LM-2012-04, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2012.
in: Networks 63(1), 2014, 119-133.
doi: 10.1002/net.21526
pdf
On the Generalized Directed Rural Postman Problem
Michael Drexl
Technical Report LM-2012-03, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2012.
in: Journal of the Operational Research Society
doi: 10.1057/jors.2013.60
pdf
A Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems
Michael Drexl
Technical Report LM-2012-02, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2012.
in: European Journal of Operational Research 229(3), 2013, 595-598.
doi: 10.1016/j.ejor.2013.03.009
pdf
Solving Elementary Shortest-Path Problems as Mixed-Integer Programs
Michael Drexl and Stefan Irnich
Technical Report LM-2012-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2012.
in: OR Spectrum 36(2), 2014, 281-296.
doi: 10.1007/s00291-012-0302-7
pdf
Applications of the Vehicle Routing Problem with Trailers and Transshipments
Michael Drexl
Technical Report LM-2011-06, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2011.
in: European Journal of Operational Research 227(2), 2013, 275–283.
doi: 10.1016/j.ejor.2012.12.015
pdf
Simultaneous Vehicle and Crew Routing and Scheduling for Partial and Full Load Long-Distance Road Transport
Michael Drexl, Julia Rieck, Thomas Sigl, Bettina Berning
Technical Report LM-2011-05, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2011.
in: Business Research 6(2), 2013, 242-264.
link
Heuristics for a real-world mail delivery problem
Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl Doerner, Richard F. Hartl, Stefan Irnich
in: Applications of evolutionary computing, Lecture Notes in Computer Science (LNCS), 6625/2011, 481-490.
doi: 10.1007/978-3-642-20520-0_49
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Claudia Bode, Stefan Irnich
Technical Report LM-2011-03 (revised), Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2011.
in: Operations Research 60(5), 2012, 1167-1182.
doi: 10.1287/opre.1120.1079
pdf
Manufacturing capacity planning and the value of multi-stage stochastic programming under Markovian demand
Holger A. Stephan, Timo Gschwind, Stefan Minner
in: Flexible Services and Manufacturing Journal 22, 2010, 143-162.
doi: 10.1007/s10696-010-9071-2
Rich Vehicle Routing in Theory and Practice
Michael Drexl
Technical Report LM-2011-04, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, 2011.
in: Logistics Research 5(1-2), 2012, 47-63.
doi: 10.1007/s12159-012-0080-2
pdf
Synchronization in Vehicle Routing-A Survey of VRPs with Multiple Synchronization Constraints
Michael Drexl
Technical Report LM-2011-02, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, 2011.
in: Transportation Science 46(3), 2012, 297-316.
doi: 10.1287/trsc.1110.0400
pdf
A Note on Symmetry Reduction for Circular Traveling Tournament Problems
Timo Gschwind, Stefan Irnich
Technical Report LM-2010-01,
Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2010.
in: European Journal of Operational Research, 210(2), 2011, 452-456.
doi: 10.1016/j.ejor.2010.08.015
pdf
A New Branch-and-Price Algorithm for the Traveling Tournament Problem
Stefan Irnich
Technical Report LM-2009-01, Chair of Logistics Management, Johannes Gutenberg University, Mainz, 2009.
in: European Journal of Operational Research, 204(2), 2010, 218-228.
doi: 10.1016/j.ejor.2009.10.024
pdf
Path Reduced Costs for Eliminating Arcs in Routing and Scheduling
Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar
Les Cahiers du GERAD, HEC Montréal, G-2007-79, October 2007.
in: INFORMS Journal on Computing, 22(2), 2010, 297-313.
doi:10.1287/ijoc.1090.0341
link online-supplement
Speeding up Column-Generation Algorithms by Using Reduced Costs of Paths to Eliminate Arcs
Stefan Irnich, working paper, January 2007
pdf
Vehicle-Routing Problems with Inter-Tour Resource Constraints
Christoph Hempsch and Stefan Irnich
Technical report, February 2007
in: The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series , Vol. 43, B.L. Golden, R. Raghavan, and E. Wasil, eds., 2008, ISBN: 978-0-387-77777-1
doi: 10.1007/978-0-387-77778-8_19
pdf
Undirected Postman Problems with Zigzagging Option: A Cutting-Plane Approach
Stefan Irnich, working paper, November 2006
in: Computers & Operations Research, 35(12), December 2008, 3998-4009.
doi: 10.1016/j.cor.2007.07.002
pdf
Solution of Real-World Postman Problems
Stefan Irnich, Michael Drexl, working paper, September 2006
in: European Journal of Operational Research 190(1), October 2008, 52-67.
doi: 10.1016/j.ejor.2007.06.002
pdf
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-based Metaheuristics
Stefan Irnich, working paper, August 2006 (Revised March 2007)
in: INFORMS Journal on Computing, 20(2), Spring 2008, 270-287.
doi: 10.1287/ijoc.1070.0239
pdf online supplement
Resource Extension Functions: Properties, Inversion, and Generalization to Segments
Stefan Irnich, working paper, August 2006 (Revised February 2007)
in: OR Spectrum 30(1), 2008,
doi: 10.1007/s00291-007-0083-6
pdf erratum
Optimierung im Transport, Band I: Grundlagen
Tore Grünert, Stefan Irnich, Shaker Verlag, ISBN: 3-8322-4514-6, 2005.
Amazon
Optimierung im Transport, Band II: Wege und Touren
Tore Grünert, Stefan Irnich, Shaker Verlag, ISBN: 3-8322-4515-4, 2005.
Amazon
A Note on Postman Problems with Zigzag Service
S. Irnich, working paper, November 2004
in: INFOR 43(1), 2005, 33-39.
doi: 10.1080/03155986.2005.11732713
pdf
Sequential Search and its Application to Vehicle-Routing Problems
Stefan Irnich, Birger Funke, Tore Grünert, working paper, November 2004 (Revised January 2005)
in: Computers & Operations Research 33(8), August 2006, 2405-2429.
doi: 10.1016/j.cor.2005.02.020
pdf vrp-instances
Shortest Path Problems with Resource Constraints
Stefan Irnich, Guy Desaulniers
Les Cahiers du GERAD, HEC Montréal, G-2004-11, February 2004 (Revised July 2004)
in: G. Desaulniers, Jacques Desrosiers, M.M. Solomon (eds.), Column Generation, Springer, 2005, 33-65.
doi: 10.1007/0-387-25486-2_2
link pdf
A Note on Single Alternating Cycle Neighborhoods for the TSP
Birger Funke, Tore Grünert, Stefan Irnich
Technical report, August 2003
in: Journal of Heuristics 11(2), March 2005, 135-146.
doi: 10.1007/s10732-005-0713-6
pdf
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration
Birger Funke, Tore Grünert, Stefan Irnich
Technical report, June 2003 (Revised February 2005)
in: Journal of Heuristics 11(4), July 2005, 267-306.
doi: 10.1007/s10732-005-1997-2
pdf
The Shortest Path Problem with Resource Constraints and k-Cycle Elimination for k>=3
Stefan Irnich, Daniel Villeneuve
Technical report, June 2003 (Revised September 2004)
in: INFORMS Journal on Computing 18(3), Summer 2006, 391-406.
doi: 10.1287/ijoc.1040.0117
pdf online supplement
Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hubflugproblem
Stefan Irnich, Dissertation
(Online veröffentlicht: RWTH Hochschulbibliothek) 2002.
The Shortest Path Problem with k-Cycle Elimination (k >= 3): Improving a Branch and Price Algorithm for the VRPTW
Stefan Irnich, November 2000
A Multi-Depot Pickup and Delivery Problem with a Single Hub and Heterogeneous Vehicles
Stefan Irnich
in: European Journal of Operational Research 122, 2000, 310-32.
doi: 10.1016/S0377-2217(99)00235-0
pdf
Finding all k-cliques in k-partite Graphs and their Application in Textile Engineering
Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst, April 1998
in: Computers & Operations Research 29, 2002, 13-31.
doi: 10.1016/S0305-0548(00)00053-8
pdf
Stefan Faldum, Sarah Machate, Timo Gschwind, Stefan Irnich
Jeanette Schmidt, Christian Tilk, Stefan Irnich
Katrin Heßler, Stefan Irnich
Jean Bertrand Gauthier, Stefan Irnich
Jeanette Schmidt, Christian Tilk, Stefan Irnich
Katrin Heßler, Stefan Irnich
Jeanette Schmidt, Stefan Irnich
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, and Olivier Péton
Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider
Timo Hintsch
Michael Drexl
Michael Drexl
Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde
