Andreas S. Schulz

collaborators

2 papers

math.OC2023

On the complexity of a maintenance problem for hierarchical systems

Andreas S. Schulz, Claudio Telha

We prove that a maintenance problem on frequency-constrained maintenance jobs with a hierarchical structure is integer-factorization hard. This result holds even on simple systems…

cs.DM2023

Primal Separation and Approximation for the ${0, 1/2}$ -closure

Lukas Brandl, Andreas S. Schulz

We advance the theoretical study of ${0, 1/2}$ -cuts for integer programming problems $max {c^{T} x : A x \leq b, x integer}$ . Such cuts are Gomory-Chvátal cuts that…

On the complexity of a maintenance problem for hierarchical systems

Primal Separation and Approximation for the {0,1/2}-closure

Primal Separation and Approximation for the ${0, 1/2}$ -closure