Nir Halman
YOU?
Author Swipe
View article: A faster fully polynomial time approximation scheme for proportionate flow shop scheduling with step-deteriorating processing times
A faster fully polynomial time approximation scheme for proportionate flow shop scheduling with step-deteriorating processing times Open
We consider a certain proportionate flow shop scheduling problem with step-deteriorating processing times and study two objective functions: makespan and sum of completion times. We reformulate these problems as monotone dynamic programs t…
View article: A faster FPTAS for proportionate flow shop scheduling with step-deteriorating processing times
A faster FPTAS for proportionate flow shop scheduling with step-deteriorating processing times Open
IWDSP 2023, similarly as the previous three workshops in the series, focuses on dynamic scheduling problems defined by parameters whose values are varying in time and which often appear in applications.Therefore, main topics related to the…
View article: An FPTAS and an SFPTAS for maximizing the weighted number of just-in-time jobs in a proportionate flow shop system
An FPTAS and an SFPTAS for maximizing the weighted number of just-in-time jobs in a proportionate flow shop system Open
IWDSP 2023, similarly as the previous three workshops in the series, focuses on dynamic scheduling problems defined by parameters whose values are varying in time and which often appear in applications.Therefore, main topics related to the…
View article: Knapsack problems with position-dependent item weights or profits
Knapsack problems with position-dependent item weights or profits Open
We consider three new knapsack problems with variable weights or profits of items, where the weight or profit of an item depends on the position of the item in the sequence of items packed in the knapsack. We show how to solve the problems…
View article: Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States Open
We propose a Fully Polynomial-Time Approximation Scheme (FPTAS) for stochastic dynamic programs with multidimensional action, scalar state, convex costs and linear state transition function. The action spaces are polyhedral and described b…
View article: FPTASes for minimizing makespan of deteriorating jobs with non-linear processing times
FPTASes for minimizing makespan of deteriorating jobs with non-linear processing times Open
in Poznań, which is the host of this event.The IWDSP 2018 workshop is the second event in the series started in 2016, focused on dynamic scheduling problems defined by parameters whose values are varying in time.Problems of this kind appea…
View article: Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints Open
We consider a fairly general model of “take-or-leave”decision-making. Given a number of items of a particular weight, the decision-maker either takes (accepts) an item or leaves (rejects) it. We design fully polynomial-time approximation s…
View article: A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy Open
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 integer knapsack problem: find the number of distinct mul…
View article: A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs Open
We propose a computationally efficient fully polynomial-time approximation scheme (FPTAS) to compute an approximation with arbitrary precision of the value function of convex stochastic dynamic programs, using the technique of K-approximat…