Výsledky vyhľadávania - "K-approximation sets and functions"

Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions Autor Halman, Nir, Wimer, Shmuel

“…•We study resource allocation problems in rooted trees in which demand values are given in the leaves.•Single-type resources (weights) are to be assigned in…”
Získať plný text

Fully polynomial time (Σ,Π)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs Autor Halman, Nir, Nannicini, Giacomo

“…We study the nonlinear newsvendor problem concerning goods of a non-discrete nature, and a class of stochastic dynamic programs with several application areas…”
Získať plný text

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints Autor Halman, Nir, Kellerer, Hans, Strusevich, Vitaly A.

“…•A model suitable for handling take-or-leave decisions is introduced.•The objective is a non-linear non-separable function.•The constraints are nested linear…”
Získať plný text

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times Autor Halman, Nir

“… of the K -approximation sets and functions technique…”
Získať plný text

The TV advertisements scheduling problem Autor Díaz-Núñez, Fabián, Halman, Nir, Vásquez, Óscar C.

“… . We show that this problem is NP-hard and propose a fully polynomial time approximation scheme, using a special dominance property of an optimal schedule and the technique of K -approximation sets…”
Získať plný text

Strongly Polynomial FPTASes for Monotone Dynamic Programs Autor Alon, Tzvi, Halman, Nir

“… (non strongly polynomial) FPTASes which were designed via the method of K -approximation sets and functions…”
Získať plný text

Bi-criteria path problem with minimum length and maximum survival probability Autor Halman, Nir, Kovalyov, Mikhail Y., Quilliot, Alain, Shabtay, Dvir, Zofi, Moshe

“…We study a bi-criteria path problem on a directed multigraph with cycles, where each arc is associated with two parameters. The first is the survival…”
Získať plný text

Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks Autor Halman, Nir, Li, Chung-Lun, Simchi-Levi, David

“…–parallel activity network. We develop fully polynomial-time approximation schemes for both problems using K -approximation sets and functions, together with series…”
Získať plný text

An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences Autor Halman, Nir, Vinetz, Uriel

“…In this paper we consider a resource-constrained scheduling problem on two parallel dedicated machines with given fixed processing sequences of jobs assigned…”
Získať plný text

Fully polynomial time approximation schemes (FPTAS) for some counting problems Autor Alon, Tzvi

“… Our results are derived by using, as well as expanding, the method of K-approximation sets and functions…”
Získať plný text