37 citations · 39 across the 5 of their papers we have counts for
6 papers
On the Complexity of Recognizing Integrality and Total Dual Integrality of the -Closure
Matthias Brugger, Andreas S. Schulz
The -closure of a rational polyhedron is obtained by adding all Gomory-Chvátal cuts that can be derived from the linear system $Ax \le…
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…
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard
Andreas S. Schulz, Claudio Telha
Distribution networks with periodically repeating events often hold great promise to exploit economies of scale. Joint replenishment problems are a fundamental model in inventory m…
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover
Felix Happach, Andreas S. Schulz
We consider single-machine scheduling problems that are natural generalizations or variations of the min-sum set cover problem and the min-sum vertex cover problem. For each of the…
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz
We present a deterministic polynomial-time algorithm for computing -approximate (pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomi…
Robust Monotone Submodular Function Maximization
James B. Orlin, Andreas S. Schulz, Rajan Udwani
We consider a robust formulation, introduced by Krause et al. (2008), of the classical cardinality constrained monotone submodular function maximization problem, and give the first…