Ass.-Prof. Dr. Christian Tilk

Contact

Telephone: +43-1-4277-38028
Fax: +43-1-4277-8-38028
E-Mail: christian.tilk@univie.ac.at
Office Hours: On appointment

Curriculum Vitae

2023	Assistant Professor for Prescriptive Analytics, University of Vienna
2018 - 2022	Co-lead in the ANR-DFG-project OPUSS: OPtimization of Urban Synchromodal Systems, Johannes Gutenberg-University of Mainz
2018	Lecturer, TU Kaiserslautern
2017	Visiting researcher, IMT Atlantique Nantes, France
2016	PhD Thesis (DR. rer. pol.) - Contributions to Column-Generation Approaches in Combinatorial Optimization, Johannes Gutenberg-University of Mainz
2011	Diploma in applied mathematics, University of Trier

Publications

Dumez D, Tilk C, Irnich S, Lehuédé F, Olkis K, Péton O. A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. European Journal of Operational Research. 2023 Feb 16;305(1):64-84. doi: 10.1016/j.ejor.2022.05.022

Schmidt J, Tilk C, Irnich S. Using public transport in a 2-echelon last-mile delivery network. European Journal of Operational Research. 2022 Nov. doi: 10.1016/j.ejor.2022.10.041

Tilk C. Adapting the ng-path relaxation for bike balancing problems. Operations Research Letters. 2022 May;50(3):241-245. doi: 10.1016/j.orl.2022.02.005

Tilk C, Olkis K, Irnich S. The last-mile vehicle routing problem with delivery options. OR Spectrum. 2021 Dec;43(4):877-904. Epub 2021 Jun 21. doi: 10.1007/s00291-021-00633-0

Bianchessi N, Irnich S, Tilk C. A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discrete Applied Mathematics. 2021 Jan 15;288:152-170. doi: 10.1016/j.dam.2020.08.014

Dumez D, Tilk C, Irnich S, Lehuédé F, Péton O. Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO Journal on Transportation and Logistics. 2021 Jan;10:100040. doi: 10.1016/j.ejtl.2021.100040

Gschwind T, Irnich S, Tilk C, Emde S. Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. Journal of Scheduling. 2020 Jun 1;23(3):363-377. doi: 10.1007/s10951-019-00620-y

Tilk C, Goel A. Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. European Journal of Operational Research. 2020 May 16;283(1):108-124. doi: 10.1016/j.ejor.2019.10.038

Tilk C, Drexl M, Irnich S. Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. European Journal of Operational Research. 2019 Jul 16;276(2):549-565. doi: 10.1016/j.ejor.2019.01.041

Tilk C, Irnich S. Combined column-and-row-generation for the optimal communication spanning tree problem. Computers and Operations Research. 2018 May;93:113-122. doi: 10.1016/j.cor.2018.01.003

Gschwind T, Irnich S, Rothenbächer AK, Tilk C. Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. European Journal of Operational Research. 2018 Apr 16;266(2):521-530. doi: 10.1016/j.ejor.2017.09.035

Tilk C, Bianchessi N, Drexl M, Irnich S, Meisel F. Branch-And-price-And-cut for the active-passive vehicle-routing problem. Transportation Science. 2018 Mar 1;52(2):300-319. doi: 10.1287/trsc.2016.0730

Tilk C, Rothenbächer AK, Gschwind T, Irnich S. Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. European Journal of Operational Research. 2017 Sep 1;261(2):530-539. doi: 10.1016/j.ejor.2017.03.017

Tilk C, Irnich S. Dynamic programming for the minimum tour duration problem. Transportation Science. 2017;51(2):549-565. doi: 10.1287/trsc.2015.0626