Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Gollapudi, Siddharth"'
Given a set of $n$ vectors in $\mathbb{R}^d$, the goal of the \emph{determinant maximization} problem is to pick $k$ vectors with the maximum volume. Determinant maximization is the MAP-inference task for determinantal point processes (DPP) and has r
Externí odkaz:
http://arxiv.org/abs/2309.15286
The joint replenishment problem (JRP) is a classical inventory management problem. We consider a natural generalization with outliers, where we are allowed to reject (that is, not service) a subset of demand points. In this paper, we are motivated by
Externí odkaz:
http://arxiv.org/abs/2308.04846