Zobrazeno 1 - 10
of 249
pro vyhledávání: '"Schulz, Andreas S."'
Appointment scheduling problems under uncertainty encounter a fundamental trade-off between cost minimization and customer waiting times. Most existing studies address this trade-off using a weighted sum approach, which puts little emphasis on indivi
Externí odkaz:
http://arxiv.org/abs/2402.12561
Autor:
Schulz, Andreas S., Telha, Claudio
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 with just two components to maintain. As a corollary, we provide a fir
Externí odkaz:
http://arxiv.org/abs/2312.17569
Autor:
Brandl, Lukas, Schulz, Andreas S.
We advance the theoretical study of $\{0, 1/2\}$-cuts for integer programming problems $\max\{c^T x \colon A x \leq b, x \text{ integer}\}$. Such cuts are Gomory-Chv\'atal cuts that only need multipliers of value $0$ or $1/2$ in their derivation. The
Externí odkaz:
http://arxiv.org/abs/2311.03909
Autor:
Brugger, Matthias, Schulz, Andreas S.
The $\{0,\frac{1}{2}\}$-closure of a rational polyhedron $\{ x \colon Ax \le b \}$ is obtained by adding all Gomory-Chv\'atal cuts that can be derived from the linear system $Ax \le b$ using multipliers in $\{0,\frac{1}{2}\}$. We show that deciding w
Externí odkaz:
http://arxiv.org/abs/2104.14486
We introduce a simple, accurate, and extremely efficient method for numerically solving the multi-marginal optimal transport (MMOT) problems arising in density functional theory. The method relies on (i) the sparsity of optimal plans [for $N$ margina
Externí odkaz:
http://arxiv.org/abs/2103.12624
Autor:
Schulz, Andreas S., Telha, Claudio
Distribution networks with periodically repeating events often hold great promise to exploit economies of scale. Joint replenishment problems are a fundamental model in inventory management, manufacturing, and logistics that capture these effects. Ho
Externí odkaz:
http://arxiv.org/abs/2007.09045
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Happach, Felix, Schulz, Andreas S.
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 these problems, we give new approximation algorithms. Some of these algor
Externí odkaz:
http://arxiv.org/abs/2001.07011
We present a deterministic polynomial-time algorithm for computing $d^{d+o(d)}$-approximate (pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial cost functions of degree at most $d$. This is an exponential improv
Externí odkaz:
http://arxiv.org/abs/1810.12806