Volgen
Clemens Thielen
Clemens Thielen
Professor of Complex Networks at TUM Campus Straubing, HSWT
Geverifieerd e-mailadres voor tum.de
Titel
Geciteerd door
Geciteerd door
Jaar
The generalized assignment problem with minimum quantities
SO Krumke, C Thielen
European Journal of Operational Research 228 (1), 46-55, 2013
832013
Complexity of the traveling tournament problem
C Thielen, S Westphal
Theoretical Computer Science 412 (4-5), 345-351, 2011
812011
Approximation methods for multiobjective optimization problems: A survey
A Herzel, S Ruzika, C Thielen
INFORMS Journal on Computing 33 (4), 1284-1299, 2021
462021
Mixed integer programming for dynamic tower crane and storage area optimization on construction sites
K Riga, K Jahr, C Thielen, A Borrmann
Automation in Construction 120, 103259, 2020
322020
Interval scheduling on related machines
SO Krumke, C Thielen, S Westphal
Computers & Operations Research 38 (12), 1836-1844, 2011
292011
Budget-constrained minimum cost flows
M Holzhauser, SO Krumke, C Thielen
Journal of Combinatorial Optimization 31 (4), 1720-1745, 2016
252016
Approximation schemes for the parametric knapsack problem
A Giudici, P Halffmann, S Ruzika, C Thielen
Information Processing Letters 120, 11-15, 2017
232017
Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization
SO Krumke, C Thielen, C Zeck
Mathematical Methods of Operations Research 74, 53-75, 2011
222011
Approximation algorithms for TTP (2)
C Thielen, S Westphal
Mathematical Methods of Operations Research 76 (1), 1-20, 2012
192012
Assortment planning for multiple chain stores
H Corsten, M Hopf, B Kasper, C Thielen
OR Spectrum 40, 875-912, 2018
182018
The online knapsack problem with incremental capacity
C Thielen, M Tiedemann, S Westphal
Mathematical Methods of Operations Research 83, 207-242, 2016
182016
The power of the weighted sum scalarization for approximating multiobjective optimization problems
C Bazgan, S Ruzika, C Thielen, D Vanderpooten
Theory of Computing Systems, 1-21, 2022
162022
A network simplex method for the budget-constrained minimum cost flow problem
M Holzhauser, SO Krumke, C Thielen
European journal of operational research 259 (3), 864-872, 2017
162017
Minimum cost flows with minimum quantities
SO Krumke, C Thielen
Information processing letters 111 (11), 533-537, 2011
162011
One-exact approximate Pareto sets
A Herzel, C Bazgan, S Ruzika, C Thielen, D Vanderpooten
Journal of Global Optimization 80 (1), 87-115, 2021
142021
Maximum flows in generalized processing networks
M Holzhauser, SO Krumke, C Thielen
Journal of Combinatorial Optimization 33, 1226-1256, 2017
142017
Approximating the product knapsack problem
U Pferschy, J Schauer, C Thielen
Optimization Letters 15 (8), 2529-2540, 2021
132021
Operational Research: methods and applications
F Petropoulos, G Laporte, E Aktas, SA Alumur, C Archetti, H Ayhan, ...
Journal of the Operational Research Society 75 (3), 423-617, 2024
122024
Complexity and approximability of the maximum flow problem with minimum quantities
C Thielen, S Westphal
Networks 62 (2), 125-131, 2013
122013
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Z Abel, J Bosboom, M Coulombe, ED Demaine, L Hamilton, A Hesterberg, ...
Theoretical Computer Science 839, 41-102, 2020
112020
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20