受强制性开放获取政策约束的文章 - Stefan Lendl了解详情
无法在其他位置公开访问的文章：2 篇
On the complexity of robust multi-stage problems with discrete recourse
M Goerigk, S Lendl, L Wulf
Discrete Applied Mathematics 343, 355-370, 2024
强制性开放获取政策： Austrian Science Fund, German Research Foundation
Linearizable special cases of the quadratic shortest path problem
E Çela, B Klinz, S Lendl, JB Orlin, GJ Woeginger, L Wulf
Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021
强制性开放获取政策： Austrian Science Fund
可在其他位置公开访问的文章：14 篇
Combinatorial optimization with interaction costs: Complexity and solvable cases
S Lendl, A Ćustić, AP Punnen
Discrete optimization 33, 101-117, 2019
强制性开放获取政策： Austrian Science Fund, Natural Sciences and Engineering Research Council of …
Continuous facility location on graphs
TA Hartmann, S Lendl, GJ Woeginger
Mathematical Programming 192 (1), 207-227, 2022
强制性开放获取政策： Austrian Science Fund, German Research Foundation
Recoverable robust representatives selection problems with discrete budgeted uncertainty
M Goerigk, S Lendl, L Wulf
European Journal of Operational Research 303 (2), 567-580, 2022
强制性开放获取政策： Austrian Science Fund
Matroid bases with cardinality constraints on the intersection
S Lendl, B Peis, V Timmermans
Mathematical Programming, 1-24, 2022
强制性开放获取政策： Austrian Science Fund
A linear time algorithm for the robust recoverable selection problem
T Lachmann, S Lendl, GJ Woeginger
Discrete Applied Mathematics 303, 94-107, 2021
强制性开放获取政策： Austrian Science Fund
Two-stage robust optimization problems with two-stage uncertainty
M Goerigk, S Lendl, L Wulf
European Journal of Operational Research 302 (1), 62-78, 2022
强制性开放获取政策： Austrian Science Fund
Robust combinatorial optimization with locally budgeted uncertainty
M Goerigk, S Lendl
Open Journal of Mathematical Optimization 2, 1-18, 2021
强制性开放获取政策： Austrian Science Fund, German Research Foundation
Dispersing obnoxious facilities on a graph
A Grigoriev, TA Hartmann, S Lendl, GJ Woeginger
Algorithmica 83 (6), 1734-1749, 2021
强制性开放获取政策： Austrian Science Fund, German Research Foundation
The Steiner cycle and path cover problem on interval graphs
A Ćustić, S Lendl
Journal of combinatorial optimization 43 (1), 226-234, 2022
强制性开放获取政策： Austrian Science Fund
Assistance and interdiction problems on interval graphs
HP Hoang, S Lendl, L Wulf
Discrete Applied Mathematics 340, 153-170, 2023
强制性开放获取政策： Austrian Science Fund
Allocating indivisible items with minimum dissatisfaction on preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ...
Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021
强制性开放获取政策： Slovenian Research Agency
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
E Çela, B Klinz, S Lendl, GJ Woeginger, L Wulf
Mathematical Programming, 1-24, 2024
强制性开放获取政策： Austrian Science Fund
Allocation of indivisible items with individual preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
Discrete Applied Mathematics 334, 45-62, 2023
强制性开放获取政策： Slovenian Research Agency
Non-Preemptive Tree Packing
S Lendl, G Woeginger, L Wulf
Algorithmica 85 (3), 783-804, 2023
强制性开放获取政策： Austrian Science Fund, German Research Foundation
出版信息和资助信息由计算机程序自动确定