Подписаться
Jannik Matuschke
Jannik Matuschke
KU Leuven
Подтвержден адрес электронной почты в домене kuleuven.be - Главная страница
Название
Процитировано
Процитировано
Год
Fare evasion in transit networks
J Correa, T Harks, VJC Kreuzen, J Matuschke
Operations research 65 (1), 165-183, 2017
552017
Approximation algorithms for capacitated location routing
T Harks, FG König, J Matuschke
Transportation Science 47, 2013
542013
An integrated approach to tactical transportation planning in logistics networks
T Harks, FG König, J Matuschke, AT Richter, J Schulz
Transportation science 50 (2), 439-460, 2016
312016
Matchings with lower quotas: Algorithms and complexity
A Arulselvan, Á Cseh, M Groß, DF Manlove, J Matuschke
Algorithmica 80, 185-208, 2018
292018
Strong LP formulations for scheduling splittable jobs on unrelated machines
J Correa, A Marchetti-Spaccamela, J Matuschke, L Stougie, O Svensson, ...
Mathematical Programming 154, 305-328, 2015
292015
Popular branchings and their dual certificates
T Kavitha, T Király, J Matuschke, I Schlotter, U Schmidt-Kraepelin
Mathematical Programming 192 (1), 567-595, 2022
242022
Abstract flows over time: A first step towards solving dynamic packing problems
JPW Kappmeier, J Matuschke, B Peis
Theoretical Computer Science 544, 74-83, 2014
232014
Reference points and approximation algorithms in multicriteria discrete optimization
C Büsing, KS Goetzmann, J Matuschke, S Stiller
European Journal of Operational Research 260 (3), 829-840, 2017
22*2017
Protection of flows under targeted attacks
J Matuschke, ST McCormick, G Oriolo, B Peis, M Skutella
Operations Research Letters 45 (1), 53-59, 2017
202017
The complexity of computing a robust flow
Y Disser, J Matuschke
Operations Research Letters 48 (1), 18-23, 2020
182020
Robust randomized matchings
J Matuschke, M Skutella, JA Soto
ACM-SIAM Symposium on Discrete Algorithms, 2015
172015
A local-search algorithm for Steiner forest
M Groß, A Gupta, A Kumar, J Matuschke, DR Schmidt, M Schmidt, ...
arXiv preprint arXiv:1707.02753, 2017
162017
Exact and approximation algorithms for the expanding search problem
B Hermans, R Leus, J Matuschke
INFORMS Journal on Computing 34 (1), 281-296, 2022
152022
Stable flows over time
Á Cseh, J Matuschke, M Skutella
Algorithms 6 (3), 532-545, 2013
142013
The traveling salesman problem with drones: The benefits of retraversing the arcs
N Morandi, R Leus, J Matuschke, H Yaman
Transportation Science 57 (5), 1340-1358, 2023
132023
Bifactor approximation for location routing with vehicle and facility capacities
OFC Heine, A Demleitner, J Matuschke
European Journal of Operational Research 304 (2), 429-442, 2023
122023
Network flows and network design in theory and practice
J Matuschke
TU Berlin, 2013
122013
Degree-constrained orientations of embedded graphs
Y Disser, J Matuschke
Algorithms and Computation, 23rd International Symposium, ISAAC 2012, 433 …, 2011
12*2011
The popular assignment problem: when cardinality is more important than popularity∗
T Kavitha, T Király, J Matuschke, I Schlotter, U Schmidt-Kraepelin
Proceedings of the 2022 annual ACM-SIAM symposium on discrete algorithms …, 2022
102022
New and simple algorithms for stable flow problems
Á Cseh, J Matuschke
Algorithmica 81 (6), 2557-2591, 2019
92019
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20