• Publications
  • Influence
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
TLDR
The single-item stochastic inventory control problem is to find an inventory replenishment policy to minimize the expected procurement and holding/backlogging cost. Expand
  • 60
  • 6
  • PDF
Fully polynomial time approximation schemes for stochastic dynamic programs
TLDR
We develop a framework for obtaining (deterministic) Fully Polynomial Time Approximation Schemes (FPTAS) for stochastic univariate dynamic programs with convex or monotone single-period cost functions. Expand
  • 50
  • 4
  • PDF
One-way and round-trip center location problems
TLDR
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 and his respective nearest server. Expand
  • 26
  • 3
The convex dimension of a graph
TLDR
We study the convex and strong convex dimensions and the extremal number of edges of graphs with given convex dimension. Expand
  • 14
  • 3
  • PDF
On the complexity of energy storage problems
TLDR
We show that the deterministic version of the problem can be cast as a minimum-cost flow problem and solved in strongly polynomial time, but the problem becomes #P-hard as soon as uncertainty is introduced. Expand
  • 9
  • 3
  • PDF
Discrete and Lexicographic Helly Theorems and Their Relations to LP-type problems
Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in IR have a common point, then there is a point common to all of the objects in the set. We define three newExpand
  • 13
  • 2
  • PDF
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems
  • Nir Halman
  • Mathematics, Computer Science
  • Algorithmica
  • 1 September 2007
TLDR
We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Expand
  • 53
  • 1
  • PDF
Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
TLDR
We provide a fully polynomial time approximation scheme for the nonlinear single-item stochastic lot-sizing problem, when demand distribution is given by an oracle, procurement costs are provided as nondecreasing oracles, holding/backlogging/disposal costs are linear. Expand
  • 22
  • 1
  • PDF
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
TLDR
We consider the deadline problem and budget problem of the nonlinear time-cost tradeoff project scheduling model in a series-parallel activity network using K-approximation sets and functions, together with series and parallel reductions. Expand
  • 11
  • 1
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
TLDR
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 by Halman et al. Expand
  • 9
  • 1
...
1
2
3
4
...