[Zurück]
Ass.-Prof. Dr. Christian Tilk
T: +43-1-4277-38028
1 - 19 von 19
Schmidt, J., Tilk, C., & Irnich, S. (2024). Exact Solution of the Vehicle Routing Problem with Drones. Transportation Science. https://doi.org/10.1287/trsc.2024.0544
Kötschau, R., Scherr, N., Tilk, C., & Ehmke, J. F. (2025). Mobile Home Delivery Parcel Lockers. Transportation Research Part E: Logistics and Transportation Review , 193(103867), Artikel 103867. Vorzeitige Online-Publikation. https://doi.org/10.1016/j.tre.2024.103867
Dehghan Chenary, M., Irnich, S., Hartl, R., & Tilk, C. (2024). On Combining Conventional Point-To-Point and Automated Waste Collection Systems. https://ucloud.univie.ac.at/index.php/s/ESPqq37tm9LmnGf
Rist, Y., Tilk, C., & Forbes, M. (2024). Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem. European Journal of Operational Research, 318(3), 836-850. https://doi.org/10.1016/j.ejor.2024.05.041
Schmidt, J., Tilk, C., & Irnich, S. (2024). Using public transport in a 2-echelon last-mile delivery network. European Journal of Operational Research, 317(3), 827-840. https://doi.org/10.1016/j.ejor.2022.10.041
Otto, A., & Tilk, C. (2024). Intelligent design of sensor networks for data-driven sensor maintenance at railways. Omega (United Kingdom), 127, Artikel 103094. https://doi.org/10.1016/j.omega.2024.103094
Dumez, D., Tilk, C., Irnich, S., Lehuédé, F., Olkis, K., & Péton, O. (2023). A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows. European Journal of Operational Research, 305(1), 64-84. https://doi.org/10.1016/j.ejor.2022.05.022
Tilk, C. (2022). Adapting the ng-path relaxation for bike balancing problems. Operations Research Letters, 50(3), 241-245. https://doi.org/10.1016/j.orl.2022.02.005
Tilk, C., Olkis, K., & Irnich, S. (2021). The last-mile vehicle routing problem with delivery options. OR Spectrum, 43(4), 877-904. https://doi.org/10.1007/s00291-021-00633-0
Bianchessi, N., Irnich, S., & Tilk, C. (2021). A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discrete Applied Mathematics, 288, 152-170. https://doi.org/10.1016/j.dam.2020.08.014
Dumez, D., Tilk, C., Irnich, S., Lehuédé, F., & Péton, O. (2021). Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO Journal on Transportation and Logistics, 10, Artikel 100040. https://doi.org/10.1016/j.ejtl.2021.100040
Gschwind, T., Irnich, S., Tilk, C., & Emde, S. (2020). Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. Journal of Scheduling, 23(3), 363-377. https://doi.org/10.1007/s10951-019-00620-y
Tilk, C., & Goel, A. (2020). Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. European Journal of Operational Research, 283(1), 108-124. https://doi.org/10.1016/j.ejor.2019.10.038
Tilk, C., Drexl, M., & Irnich, S. (2019). Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. European Journal of Operational Research, 276(2), 549-565. https://doi.org/10.1016/j.ejor.2019.01.041
Tilk, C., & Irnich, S. (2018). Combined column-and-row-generation for the optimal communication spanning tree problem. Computers and Operations Research, 93, 113-122. https://doi.org/10.1016/j.cor.2018.01.003
Gschwind, T., Irnich, S., Rothenbächer, A. K., & Tilk, C. (2018). Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. European Journal of Operational Research, 266(2), 521-530. https://doi.org/10.1016/j.ejor.2017.09.035
Tilk, C., Bianchessi, N., Drexl, M., Irnich, S., & Meisel, F. (2018). Branch-And-price-And-cut for the active-passive vehicle-routing problem. Transportation Science, 52(2), 300-319. https://doi.org/10.1287/trsc.2016.0730
Tilk, C., Rothenbächer, A. K., Gschwind, T., & Irnich, S. (2017). Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. European Journal of Operational Research, 261(2), 530-539. https://doi.org/10.1016/j.ejor.2017.03.017
Tilk, C., & Irnich, S. (2017). Dynamic programming for the minimum tour duration problem. Transportation Science, 51(2), 549-565. https://doi.org/10.1287/trsc.2015.0626
1 - 19 von 19

On Combining Conventional Point-To-Point and Automated Waste Collection Systems

Christian Tilk (Vortragende*r)

19 Sept. 2024

Aktivität: Vorträge › Vortrag › Science to Science

On Combining Conventional Point-To-Point and Automated Waste Collection Systems

Christian Tilk (Vortragende*r)

5 Sept. 2024

Aktivität: Vorträge › Vortrag › Science to Science

On Combining Conventional Point-To-Point and Automated Waste Collection Systems

Christian Tilk (Vortragende*r)

27 Mai 2024

Aktivität: Vorträge › Vortrag › Science to Science

A Matheuristic for a 2-Echelon Vehicle Routing Problem with Capacitated Satellites and Reverse Flows

Christian Tilk (Vortragende*r)

21 Sept. 2023

Aktivität: Vorträge › Vortrag › Science to Science

A bidirectional labeling algorithm for solving the vehicle routing problem with drones

Christian Tilk (Vortragende*r)

16 Mai 2023 → 19 Mai 2023

Aktivität: Vorträge › Vortrag › Science to Science

Institut für Business Decisions and Analytics

stv. Leiter

Kolingasse 14-16
1090 Wien
Zimmer: 05.29

T: +43-1-4277-38028

christian.tilk@univie.ac.at