#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2003

2019

- This year (2)
- Last 5 years (12)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We develop a framework for obtaining (deterministic) Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period cost… (More)

- Nir Halman, Diego Klabjan, Mohamed Mostagir, James B. Orlin, David Simchi-Levi
- Math. Oper. Res.
- 2009

The single-item stochastic inventory control problem is to find an inventory replenishment policy in the presence of independent discrete stochastic demands under periodic review and finite time… (More)

- Nir Halman
- Algorithmica
- 2007

AbstractWe show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl [SW] for LP-type problems, we obtain… (More)

- Nir Halman
- 2004

- Arie Tamir, Nir Halman
- Discrete Optimization
- 2005

In the classical p-center problem there is a set V of points (customers) in some metric space, and the objective is to locate p centers (servers), minimizing the maximum distance between a customer… (More)

- Nir Halman, Shmuel Onn, Uriel G. Rothblum
- Discrete Applied Mathematics
- 2007

The convex dimension of a graph G=(V,E) is the smallest dimension d for which G admits an injective map f:V@?R^d of its vertices into d-space, such that the barycenters of the images of the edges of… (More)

- Nir Halman
- Theor. Comput. Sci.
- 2016

Given n elements with nonnegative integer weights w = ( w 1 , ź , w n ) , an integer capacity C and positive integer ranges u = ( u 1 , ź , u n ) , we consider the counting version of the classic… (More)

- Nir Halman, Giacomo Nannicini, James B. Orlin
- ESA
- 2013

We propose a computationally efficient Fully Polynomial-Time Approximation Scheme (FPTAS) for convex stochastic dynamic programs using the technique of K-approximation sets and functions introduced… (More)

- Nir Halman, James B. Orlin, David Simchi-Levi
- Operations Research
- 2012

The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of discrete stochastic demands under periodic review and finite time horizon. A closely… (More)

The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of a stochastic demand under periodic review and finite time horizon. The computational… (More)