von Aspern, Maximilian; Buld, Felix; Klein, Nicklas;Pinedo, Michael
Flow shops with reentry: The total weighted completion time objective
CoRR
2024

Brandl, Lukas;Schulz, Andreas S.
Primal Separation and Approximation for the {0,1/2}-closure
Operations Research Letters
2024
57
107156

Giannakopoulos, Yiannis;Grosz, Alexander;Melissourgos, Themistoklis
On the Smoothed Complexity of Combinatorial Local Search
The 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP)
Tallinn, Estonia
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2024

Schulz, Andreas S.;Telha, Claudio
On the complexity of a maintenance problem for hierarchical systems
Operations Research Letters
2024
107117

Bauerhenne, Carolin;Kolisch, Rainer;Schulz, Andreas S.
Robust Appointment Scheduling with Waiting Time Guarantees
CoRR
2024

Schulz, Andreas S.;Telha, Claudio
On the complexity of a maintenance problem for hierarchical systems
CoRR
2023

Grosz, Alexander;Kietreiber, Tobias;Pfannerer, Stephan;Rubey, Martin
A bijectionist's toolkit
Séminaire Lotharingien de Combinatoire
2023
89B
-

Brandl, Lukas;Schulz, Andreas S.
Primal Separation and Approximation for the {0, 1/2}-closure
CoRR
2023

Kaiser, Marcus
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
2022

Happach, Felix;Schulz, Andreas S.
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
Mathematics of Operations Research
2023
49
1
578–598