Felix Happach

According to our database, Felix Happach authored at least 9 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover.

Felix Happach, Andreas S. Schulz

Math. Oper. Res., 2024

2023

An Algorithm for the Separation-Preserving Transition of Clusterings.

Steffen Borgwardt, Felix Happach, Stetson Zirkelbach

INFORMS J. Optim., January, 2023

2022

A General Framework for Approximating Min Sum Ordering Problems.

Felix Happach, Lisa Hellerstein, Thomas Lidbetter

INFORMS J. Comput., 2022

2021

Makespan minimization with OR-precedence constraints.

Felix Happach

J. Sched., 2021

2020

Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover.

Felix Happach, Andreas S. Schulz

CoRR, 2020

2019

Good Clusterings Have Large Volume.

Steffen Borgwardt, Felix Happach

Oper. Res., 2019

Budget Minimization with Precedence Constraints.

Marinus Gottschau, Felix Happach, Marcus Kaiser, Clara Waldmann

CoRR, 2019

Precedence-Constrained Scheduling and Min-Sum Set Cover.

Felix Happach, Andreas S. Schulz

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

2017

Stable Clusterings and the Cones of Outer Normals.

Felix Happach

Proceedings of the Operations Research Proceedings 2017, 2017