The single-item stochastic inventory control problem is to find an inventory replenishment policy to minimize the expected procurement and holding/backlogging cost.Expand

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

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

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

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 new… Expand

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

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

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