Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Lendl, Stefan
123  Ergebnisse:
?
1

On the complexity of robust multi-stage problems with discr..:

Goerigk, Marc ; Lendl, Stefan ; Wulf, Lasse
Discrete Applied Mathematics.  343 (2024)  - p. 355-370 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Rescheduling with New Orders Under Bounded Disruption:

Lendl, Stefan ; Pferschy, Ulrich ; Rener, Elena
INFORMS Journal on Computing.  , 2024
Link: https://doi.org/10.1287/..
 
?
3

A linear time algorithm for linearizing quadratic and highe..:

Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan..
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
4

Assistance and interdiction problems on interval graphs:

Hoang, Hung P. ; Lendl, Stefan ; Wulf, Lasse
Discrete Applied Mathematics.  340 (2023)  - p. 153-170 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Allocation of indivisible items with individual preference ..:

Chiarelli, Nina ; Dallard, Clément ; Darmann, Andreas...
Discrete Applied Mathematics.  334 (2023)  - p. 45-62 , 2023
Link: https://doi.org/10.1016/..
 
?
6

A Linear Time Algorithm for Linearizing Quadratic and Highe..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan.. - p. 466-479 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Two-Stage robust optimization problems with two-stage uncer..:

Goerigk, Marc ; Lendl, Stefan ; Wulf, Lasse
European Journal of Operational Research.  302 (2022)  1 - p. 62-78 , 2022
Link: https://doi.org/10.1016/..
 
?
8

Non-Preemptive Tree Packing:

Lendl, Stefan ; Woeginger, Gerhard ; Wulf, Lasse
Algorithmica.  85 (2022)  3 - p. 783-804 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Recoverable robust representatives selection problems with ..:

Goerigk, Marc ; Lendl, Stefan ; Wulf, Lasse
European Journal of Operational Research.  303 (2022)  2 - p. 567-580 , 2022
Link: https://doi.org/10.1016/..
 
?
10

Dispersing Obnoxious Facilities on a Graph:

Grigoriev, Alexander ; Hartmann, Tim A. ; Lendl, Stefan.
Algorithmica.  83 (2021)  6 - p. 1734-1749 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Continuous facility location on graphs:

Hartmann, Tim A. ; Lendl, Stefan ; Woeginger, Gerhard J.
Mathematical Programming.  192 (2021)  1-2 - p. 207-227 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Allocating Indivisible Items with Minimum Dissatisfaction o..:

, In: Algorithmic Decision Theory; Lecture Notes in Computer Science,
Chiarelli, Nina ; Dallard, Clément ; Darmann, Andreas... - p. 243-257 , 2021
Link: https://doi.org/10.1007/..
 
?
13

A linear time algorithm for the robust recoverable selectio..:

Lachmann, Thomas ; Lendl, Stefan ; Woeginger, Gerhard J.
Discrete Applied Mathematics.  303 (2021)  - p. 94-107 , 2021
Link: https://doi.org/10.1016/..
 
?
14

The Steiner cycle and path cover problem on interval graphs:

Ćustić, Ante ; Lendl, Stefan
Journal of Combinatorial Optimization.  43 (2021)  1 - p. 226-234 , 2021
Link: https://doi.org/10.1007/..
 
?
15

Matroid bases with cardinality constraints on the intersect..:

Lendl, Stefan ; Peis, Britta ; Timmermans, Veerle
Mathematical Programming.  194 (2021)  1-2 - p. 661-684 , 2021
Link: https://doi.org/10.1007/..
 
1-15