Stephan Westphal
Stephan Westphal
Professor of Discrete Optimization, Technische Universität Clausthal
Verified email at
Cited by
Cited by
Complexity of the traveling tournament problem
C Thielen, S Westphal
Theoretical Computer Science 412 (4-5), 345-351, 2011
A note on the k-Canadian traveller problem
S Westphal
Information Processing Letters 106 (3), 87-89, 2008
Improved resource efficiency and cascading utilisation of renewable materials
J Geldermann, LM Kolbe, A Krause, C Mai, H Militz, VS Osburg, ...
Journal of Cleaner Production 110, 1-8, 2016
A 5.875-approximation for the traveling tournament problem
S Westphal, K Noparlik
Annals of Operations Research 218, 347-360, 2014
An optimal randomized online algorithm for the -Canadian Traveller Problem on node-disjoint paths
M Bender, S Westphal
Journal of Combinatorial Optimization 30 (1), 87-96, 2015
A combined local search and integer programming approach to the traveling tournament problem
M Goerigk, S Westphal
Annals of Operations Research 239, 343-354, 2016
Scheduling the German basketball league
S Westphal
Interfaces 44 (5), 498-508, 2014
Interval scheduling on related machines
SO Krumke, C Thielen, S Westphal
Computers & Operations Research 38 (12), 1836-1844, 2011
Solving the traveling tournament problem by packing three-vertex paths
M Goerigk, R Hoshino, K Kawarabayashi, S Westphal
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
An application of deterministic and robust optimization in the wood cutting industry
J Ide, M Tiedemann, S Westphal, F Haiduk
4OR 13, 35-57, 2015
Approximation algorithms for TTP (2)
C Thielen, S Westphal
Mathematical Methods of Operations Research 76 (1), 1-20, 2012
Pruning in column generation for service vehicle dispatching
S Westphal, SO Krumke
Annals of operations research 159 (1), 355-371, 2008
Approximation algorithms for a vehicle routing problem
SO Krumke, S Saliba, T Vredeveld, S Westphal
Mathematical methods of operations research 68 (2), 333-359, 2008
The online knapsack problem with incremental capacity
C Thielen, M Tiedemann, S Westphal
Mathematical Methods of Operations Research 83, 207-242, 2016
A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction
F Bollwein, S Westphal
Applied Intelligence 51 (10), 7552-7572, 2021
Engineering human–machine teams for trusted collaboration
B Alhaji, J Beecken, R Ehlers, J Gertheiss, F Merz, JP Müller, M Prilla, ...
Big Data and Cognitive Computing 4 (4), 35, 2020
New lower bounds for online k-server routing problems
I Fink, SO Krumke, S Westphal
Information Processing Letters 109 (11), 563-567, 2009
Packing items into several bins facilitates approximating the separable assignment problem
M Bender, C Thielen, S Westphal
Information Processing Letters 115 (6-8), 570-575, 2015
Complexity and approximability of the maximum flow problem with minimum quantities
C Thielen, S Westphal
Networks 62 (2), 125-131, 2013
A column generation approach for optimized routing and coordination of a UAV fleet
J Zillies, S Westphal, D Thakur, V Kumar, G Pappas, D Scheidt
2016 IEEE International Symposium on Safety, Security, and Rescue Robotics …, 2016
The system can't perform the operation now. Try again later.
Articles 1–20