关注
Jan Boeckmann
Jan Boeckmann
在 jku.at 的电子邮件经过验证
标题
引用次数
引用次数
年份
Approximating single-and multi-objective nonlinear sum and product knapsack problems
J Boeckmann, C Thielen, U Pferschy
Discrete Optimization 48, 100771, 2023
42023
A (B+ 1)-approximation for network flow interdiction with unit costs
J Boeckmann, C Thielen
Discrete Applied Mathematics, 2021
42021
Complexity of the Temporal Shortest Path Interdiction Problem
J Boeckmann, C Thielen, A Wittmann
2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023), 2023
22023
An approximation algorithm for network flow interdiction with unit costs and two capacities
J Boeckmann, C Thielen
Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021
22021
New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application
J Boeckmann, C Thielen
Operations Research Forum 4 (4), 86, 2023
12023
Algorithms for Municipal Flood Mitigation, Related Interdiction Problems, and Knapsack Problems
J Boeckmann
Technische Universität München, 2023
2023
Application of an optimization system to manage the risks of flash floods
M Lawens, IK Alves, J Boeckmann, C Thielen
系统目前无法执行此操作,请稍后再试。
文章 1–7