3 papers
math.OC2023
On the complexity of a maintenance problem for hierarchical systems
Andreas S. Schulz, Claudio Telha
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…
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.CG2014
Independent sets and hitting sets of bicolored rectangular families
José A. Soto, Claudio Telha
A bicolored rectangular family BRF is a collection of all axis-parallel rectangles contained in a given region Z of the plane formed by selecting a bottom-left corner from a set A…