Felix Happach

12 papers B 1Misc 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover.
Math. Oper. Res.
Felix Happach, Andreas S. Schulz
2023 J jnl
An Algorithm for the Separation-Preserving Transition of Clusterings.
INFORMS J. Optim.
Steffen Borgwardt, Felix Happach, Stetson Zirkelbach
2022 J jnl
A General Framework for Approximating Min Sum Ordering Problems.
INFORMS J. Comput.
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
2022 Misc conf
A general framework for approximating min sum ordering problems.
ISAIM
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
2021 J jnl
Makespan minimization with OR-precedence constraints.
J. Sched.
Felix Happach
2020 J jnl
A General Framework for Approximating Min Sum Ordering Problems.
CoRR
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
2020 J jnl
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover.
CoRR
Felix Happach, Andreas S. Schulz
2019 J jnl
Budget Minimization with Precedence Constraints.
CoRR
Marinus Gottschau, Felix Happach, Marcus Kaiser, Clara Waldmann
2019 J jnl
Good Clusterings Have Large Volume.
Oper. Res.
Steffen Borgwardt, Felix Happach
2019 J jnl
Makespan Minimization with OR-Precedence Constraints.
CoRR
Felix Happach
2019 B conf
Precedence-Constrained Scheduling and Min-Sum Set Cover.
WAOA
Felix Happach, Andreas S. Schulz
2017 — conf
Stable Clusterings and the Cones of Outer Normals.
OR
Felix Happach