Retsef Levi, Robin Roundy, David Shmoys, Maxim Sviridenko
Deterministic inventory theory provides streamlined optimization models that attempt to capture tradeoffs in managing the flow of goods through a supply chain. We will consider two well-studied...
Retsef Levi, Andrea Lodi, Maxim Sviridenko
We study the classical capacitated multi-item lot-sizing problem with hard capacities. There are N items, each of which has specified sequence of demands over a finite planning horizon of T discrete...
Motivated by emerging applications in workforce management, we consider a class of revenue management problems in systems with reusable resources. The corresponding applications are modeled using the...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all...
Provably near-optimal sampling-based policies for stochastic inventory control models (2006)
Retsef Levi, Robin O. Roundy, David B. Shmoys
In this paper, we consider two fundamental inventory models, the single-period newsvendor problem and its multi-period extension, but under the assumption that the explicit demand distributions are...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all...
A constant approximation algorithm for the one-warehouse multi-retailer problem (2005)
Retsef Levi, Robin Roundy, David B. Shmoys
Deterministic inventory theory provides streamlined optimization models that attempt to capture tradeoffs in managing the flow of goods through a supply chain. We will consider a well-studied...
Approximation algorithms for stochastic inventory control models (2005)
Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys
In this paper we address the long-standing problem of finding computationally efficient and provably good inventory control policies in supply chains with correlated and nonstationary...
Facility location with service installation costs (2004)
David B. Shmoys, Chaitanya Swamy, Retsef Levi
Our main result is a primal-dual 6-approximation algorithm under the assumption that there is an ordering on the facilities such that if i comes before i0 in this ordering then for every service type...
Facility location with service installation costs (2004)
David B. Shmoys, Chaitanya Swamy, Retsef Levi
Our main result is a primal-dual 6-approximation algorithm under the assumption that there is an ordering on the facilities such that if i comes before i0 in this ordering then for every service type...
Primal-dual algorithms for deterministic inventory problems (2004)
Retsef Levi, Robin Roundy, David B. Shmoys
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. These inventory...
Facility location with service installation costs (2004)
David B. Shmoys, Chaitanya Swamy, Retsef Levi
We consider a generalization of the uncapacitated facility location problem which we call Facility Location with Service Installation Costs. We are given a set of facilities, F, a set of demands or...
LP-based approximation algorithms for capacitated facility location (2004)
There has been a great deal of recent work on approximation algorithms for facility location problems [9]. We consider the capacitated facility location problem with hard capacities. We are given a...
Primal-dual algorithms for deterministic inventory problems (2004)
Retsef Levi, Robin Roundy, David B. Shmoys
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. These inventory...