2 citations · 2 across the 3 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020
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…
cs.DS2020★ 2 cited
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…