Provably near-optimal approximation schemes for implicit stochastic and sample-based dynamic programs

von Halman, Nir
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2020)

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

von Halman, Nir
Veröffentlicht in European journal of operational research (162018)

An FPTAS for the knapsack problem with parametric weights

von Halman, Nir
Veröffentlicht in Operations research letters (2018)

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks

von Halman, Nir
Veröffentlicht in Operations research letters (2009)

Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle

von Halman, Nir
Veröffentlicht in Operations research (2012)

A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand

Veröffentlicht in Mathematics of operations research (2009)

Bi-criteria path problem with minimum length and maximum survival probability

von Halman, Nir
Veröffentlicht in OR spectrum (2019)