Andreas S. Schulz

activity

20182021

most citedApproximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

1 paper · 1 filter

cs.DM2021

On the Complexity of Recognizing Integrality and Total Dual Integrality of the ${0, 1/2}$ -Closure

Matthias Brugger, Andreas S. Schulz

The ${0, \frac{1}{2}}$ -closure of a rational polyhedron ${x : A x \leq b}$ is obtained by adding all Gomory-Chvátal cuts that can be derived from the linear system $Ax \le…

On the Complexity of Recognizing Integrality and Total Dual Integrality of the {0,1/2}-Closure

On the Complexity of Recognizing Integrality and Total Dual Integrality of the ${0, 1/2}$ -Closure