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 2021Show all

2 papers · 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…

cs.LG2021

Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems

Gero Friesecke, Andreas S. Schulz, Daniela Vögler

We introduce a simple, accurate, and extremely efficient method for numerically solving the multi-marginal optimal transport (MMOT) problems arising in density functional theory. T…

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

Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems

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