1 citations · 2 across the 4 of their papers we have counts for
4 papers
The Multi-Armed Bandit, with Constraints
Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum
The early sections of this paper present an analysis of a Markov decision model that is known as the multi-armed bandit under the assumption that the utility function of the decisi…
Convex Integer Maximization via Graver Bases
J. De Loera, R. Hemmecke, S. Onn +2
We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where is a convex function on and …
Convex Combinatorial Optimization
Shmuel Onn, Uriel G. Rothblum
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly pol…
A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes
Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
We consider the {\em Shaped Partition Problem} of partitioning given vectors in real -space into parts so as to maximize an arbitrary objective function which is convex…