Zobrazeno 1 - 10
of 2 345
pro vyhledávání: '"Schulz, Andreas"'
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