Supporting the Use of Environmental Information Systems and Services - Experiences with a Course for Postgraduate Professional Education. - Roman Lenz; Werner Rolf; Christian Tilk (ISESS, 2011)

Global denken - lokal handeln: ein Beitrag zur lokalen Umsetzung der Energiewende durch 4-dimensionale GIS-basierte Solarpotenzialanalysen. - Michael Roth 009; Christian Tilk; Sina Röhner (AGIT Journal Angew. Geoinformatik, 2016)

50 Jahre alter Wein in neuen Schläuchen ‒ bundesweite GIS-basierte Landschaftsbildbewertung auf der Basis des V-Wert-Verfahrens nach Kiemstedt. - Michael Roth 009; Sina Röhner; Christian Tilk (AGIT Journal Angew. Geoinformatik, 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)

Dynamic Programming for the Minimum Tour Duration Problem. - Christian Tilk; Stefan Irnich (Transp. Sci., 2017)

Bundesweite GIS-basierte Landschaftsbildbewertung als Beitrag als Beitrag zur Umweltprüfung im Zuge des StromnetzausbausGIS and Empirically-based Nation-wide Modelling of Scenic Beauty in Germany. - Michael Roth 009; Sina Röhner; Christian Tilk; Silvio Hildebrandt (AGIT Journal Angew. Geoinformatik, 2018)

Combined column-and-row-generation for the optimal communication spanning tree problem. - Christian Tilk; Stefan Irnich (Comput. 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)

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)

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)

Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. - Christian Tilk; Asvin Goel (Eur. J. Oper. Res., 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)

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)

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)

The last-mile vehicle routing problem with delivery options. - Christian Tilk; Katharina Olkis; Stefan Irnich (OR Spectr., 2021)

Adapting the ng-path relaxation for bike balancing problems. - Christian Tilk (Oper. Res. Lett., 2022)

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)

Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem. - Yannik Rist; Christian Tilk; Michael A. Forbes 002 (Eur. J. Oper. Res., 2024)

Using public transport in a 2-echelon last-mile delivery network. - Jeanette Schmidt; Christian Tilk; Stefan Irnich (Eur. J. Oper. Res., 2024)