default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Irnich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j65]Jean Bertrand Gauthier, Stefan Irnich:
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. Discret. Appl. Math. 346: 131-153 (2024)- [j64]Jeanette Schmidt
, Christian Tilk, Stefan Irnich:
Using public transport in a 2-echelon last-mile delivery network. Eur. J. Oper. Res. 317(3): 827-840 (2024) - [j63]Nicola Bianchessi, Timo Gschwind, Stefan Irnich:
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS J. Comput. 36(1): 224-244 (2024) - [j62]Laura Lüke, Katrin Heßler, Stefan Irnich:
The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies. OR Spectr. 46(3): 909-951 (2024) - [j61]Stefan Faldum, Sarah Machate, Timo Gschwind, Stefan Irnich:
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff. OR Spectr. 46(4): 1063-1097 (2024) - 2023
- [j60]Laura Korbacher, Stefan Irnich, John Martinovic, Nico Strasdat:
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model. Discret. Appl. Math. 334: 145-162 (2023) - [j59]Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Katharina Olkis, Olivier Péton:
A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. Eur. J. Oper. Res. 305(1): 64-84 (2023) - [j58]Katrin Heßler, Stefan Irnich:
Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem. INFORMS J. Comput. 35(1): 50-65 (2023) - 2022
- [j57]Jeanette Schmidt, Stefan Irnich:
New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem. EURO J. Comput. Optim. 10: 100029 (2022) - [j56]Katrin Heßler, Stefan Irnich:
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing. Oper. Res. Lett. 50(2): 155-159 (2022) - [j55]Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy:
Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR Spectr. 44(2): 1-43 (2022) - 2021
- [j54]Nicola Bianchessi, Stefan Irnich, Christian Tilk:
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288: 152-170 (2021) - [j53]Katrin Heßler, Stefan Irnich:
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. Discret. Appl. Math. 288: 218-234 (2021) - [j52]Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Olivier Péton:
Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO J. Transp. Logist. 10: 100040 (2021) - [j51]Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo:
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput. 33(3): 1070-1090 (2021) - [j50]Christian Tilk, Katharina Olkis, Stefan Irnich:
The last-mile vehicle routing problem with delivery options. OR Spectr. 43(4): 877-904 (2021) - [j49]Timo Hintsch, Stefan Irnich, Lone Kiilerich:
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem. Transp. Sci. 55(3): 687-705 (2021) - 2020
- [j48]Timo Hintsch, Stefan Irnich:
Exact solution of the soft-clustered vehicle-routing problem. Eur. J. Oper. Res. 280(1): 164-178 (2020) - [j47]Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider:
Routing electric vehicles with a single recharge per route. Networks 76(2): 187-205 (2020) - [j46]Timo Gschwind, Stefan Irnich, Christian Tilk, Simon Emde:
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. J. Sched. 23(3): 363-377 (2020) - [j45]Guy Desaulniers, Timo Gschwind, Stefan Irnich:
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models. Transp. Sci. 54(5): 1170-1188 (2020) - [j44]Konrad Steiner, Stefan Irnich:
Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks. Transp. Sci. 54(6): 1616-1639 (2020)
2010 – 2019
- 2019
- [j43]Christian Tilk, Michael Drexl, Stefan Irnich:
Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. Eur. J. Oper. Res. 276(2): 549-565 (2019) - [j42]Timo Gschwind, Nicola Bianchessi, Stefan Irnich:
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur. J. Oper. Res. 278(1): 91-104 (2019) - [j41]David Sayah, Stefan Irnich:
Optimal booking control in revenue management with two substitutable resources. Math. Methods Oper. Res. 89(2): 189-222 (2019) - [j40]Nicola Bianchessi, Stefan Irnich:
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. Transp. Sci. 53(2): 442-462 (2019) - [j39]Nicola Bianchessi, Michael Drexl, Stefan Irnich:
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. Transp. Sci. 53(4): 1067-1084 (2019) - [j38]Qie He, Stefan Irnich, Yongjia Song:
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs. Transp. Sci. 53(5): 1409-1426 (2019) - 2018
- [j37]Christian Tilk, Stefan Irnich:
Combined column-and-row-generation for the optimal communication spanning tree problem. Comput. Oper. Res. 93: 113-122 (2018) - [j36]Timo Gschwind, Stefan Irnich, Isabel Podlinski:
Maximum weight relaxed cliques and Russian Doll Search revisited. Discret. Appl. Math. 234: 131-138 (2018) - [j35]Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk:
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 266(2): 521-530 (2018) - [j34]Timo Hintsch, Stefan Irnich:
Large multiple neighborhood search for the clustered vehicle-routing problem. Eur. J. Oper. Res. 270(1): 118-131 (2018) - [j33]Katrin Heßler, Timo Gschwind, Stefan Irnich:
Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271(2): 401-419 (2018) - [j32]Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel:
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. Transp. Sci. 52(2): 300-319 (2018) - [j31]Konrad Steiner, Stefan Irnich:
Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut. Transp. Sci. 52(4): 882-897 (2018) - [j30]Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich:
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows. Transp. Sci. 52(5): 1174-1190 (2018) - 2017
- [j29]David Sayah, Stefan Irnich:
A new compact formulation for the discrete p-dispersion problem. Eur. J. Oper. Res. 256(1): 62-67 (2017) - [j28]Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich:
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur. J. Oper. Res. 261(2): 530-539 (2017) - [j27]Timo Gschwind, Stefan Irnich:
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities. OR Spectr. 39(2): 541-556 (2017) - [j26]Christian Tilk, Stefan Irnich:
Dynamic Programming for the Minimum Tour Duration Problem. Transp. Sci. 51(2): 549-565 (2017) - [j25]Asvin Goel, Stefan Irnich:
An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems. Transp. Sci. 51(2): 737-754 (2017) - 2016
- [j24]Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte:
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250(3): 782-793 (2016) - [j23]Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich:
Branch-and-price-and-cut for a service network design and hub location problem. Eur. J. Oper. Res. 255(3): 935-947 (2016) - [j22]Timo Gschwind, Stefan Irnich:
Dual Inequalities for Stabilized Column Generation Revisited. INFORMS J. Comput. 28(1): 175-194 (2016) - [j21]Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider:
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. Oper. Res. 64(6): 1388-1405 (2016) - 2015
- [j20]Stefan Irnich, Demetrio Laganà, Claudia Schlebusch, Francesca Vocaturo:
Two-phase branch-and-cut for the mixed capacitated general routing problem. Eur. J. Oper. Res. 243(1): 17-29 (2015) - [j19]Timo Gschwind, Stefan Irnich:
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. Transp. Sci. 49(2): 335-354 (2015) - [j18]Claudia Bode, Stefan Irnich:
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem. Transp. Sci. 49(2): 369-383 (2015) - 2014
- [j17]Claudia Bode, Stefan Irnich:
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. 238(2): 415-426 (2014) - [j16]Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza:
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3): 353-374 (2014) - [j15]Michael Drexl, Stefan Irnich:
Solving elementary shortest-path problems as mixed-integer programs. OR Spectr. 36(2): 281-296 (2014) - [c2]Claudia Schlebusch, Stefan Irnich:
Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem. OR 2014: 501-506 - [p2]Stefan Irnich, Paolo Toth, Daniele Vigo:
The Family of Vehicle Routing Problems. Vehicle Routing 2014: 1-33 - [p1]Stefan Irnich, Michael Schneider, Daniele Vigo:
Four Variants of the Vehicle Routing Problem. Vehicle Routing 2014: 241-271 - 2012
- [j14]Claudia Bode, Stefan Irnich:
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem. Oper. Res. 60(5): 1167-1182 (2012) - 2011
- [j13]Timo Gschwind, Stefan Irnich:
A note on symmetry reduction for circular traveling tournament problems. Eur. J. Oper. Res. 210(2): 452-456 (2011) - [c1]Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, Stefan Irnich:
Heuristics for a Real-World Mail Delivery Problem. EvoApplications (2) 2011: 481-490 - 2010
- [j12]Stefan Irnich:
A new branch-and-price algorithm for the traveling tournament problem. Eur. J. Oper. Res. 204(2): 218-228 (2010) - [j11]Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar:
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. INFORMS J. Comput. 22(2): 297-313 (2010)
2000 – 2009
- 2009
- [i1]Stefan Irnich:
New Models and Methods for Arc Routing. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j10]Stefan Irnich:
Undirected postman problems with zigzagging option: A cutting-plane approach. Comput. Oper. Res. 35(12): 3998-4009 (2008) - [j9]Stefan Irnich:
Solution of real-world postman problems. Eur. J. Oper. Res. 190(1): 52-67 (2008) - [j8]Stefan Irnich:
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics. INFORMS J. Comput. 20(2): 270-287 (2008) - [j7]Stefan Irnich:
Resource extension functions: properties, inversion, and generalization to segments. OR Spectr. 30(1): 113-148 (2008) - 2006
- [j6]Stefan Irnich, Birger Funke, Tore Grünert:
Sequential search and its application to vehicle-routing problems. Comput. Oper. Res. 33: 2405-2429 (2006) - [j5]Stefan Irnich, Daniel Villeneuve:
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3. INFORMS J. Comput. 18(3): 391-406 (2006) - 2005
- [j4]Birger Funke, Tore Grünert, Stefan Irnich:
A Note on Single Alternating Cycle Neighborhoods for the TSP. J. Heuristics 11(2): 135-146 (2005) - [j3]Birger Funke, Tore Grünert, Stefan Irnich:
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration. J. Heuristics 11(4): 267-306 (2005) - 2002
- [j2]Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst:
Finding all k-cliques in k-partite graphs, an application in textile engineering. Comput. Oper. Res. 29(1): 13-31 (2002) - 2000
- [j1]Stefan Irnich:
A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur. J. Oper. Res. 122(2): 310-328 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
