This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal dynamic allocation of a limited promotion space to a collection of perishable items. Such a problem is motivated by applications in a variety of industries, where products have an associated lifetime after which they cannot be sold. The paper builds on recent developments on restless bandit indexation and gives an optimal marginal productivity index policy for the dynamic (single) product promotion problem with closed-form indices that yield estructural insights. The performance of the proposed policy for KPPI is investigated in a computational study
We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capa...
International audienceIn the binary single constraint Knapsack Problem, denoted KP, we are given a k...
URL des Documents de travail :http://mse.univ-paris1.fr/CES2007/2007064B.pdfDocuments de travail du ...
This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal ...
This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal d...
In this paper we introduce the knapsack problem for perishable inventories concerning the optimal dy...
Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI)...
Senior managers in retail industry make important decisions upon assortment planning, product pricin...
In this paper we propose an approach for solving problems of optimal resource capacity allocation to...
International audienceGiven a set of items, each characterized by a profit and a weight, we study th...
Given a set of items with profits and weights and a knapsack capacity, we study the problem of findi...
The concept of priority indices defined to discuss the Restless Bandit Problem (RBP) furnish a relev...
International audienceThis paper solves the binary single-constrained Knapsack Problem (KP) and unde...
We characterize the revenue maximizing policy in the dynamic and stochas-tic knapsack problem where ...
A Knapsack problem is to select among n types of items of various values and weights to fill a knap...
We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capa...
International audienceIn the binary single constraint Knapsack Problem, denoted KP, we are given a k...
URL des Documents de travail :http://mse.univ-paris1.fr/CES2007/2007064B.pdfDocuments de travail du ...
This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal ...
This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal d...
In this paper we introduce the knapsack problem for perishable inventories concerning the optimal dy...
Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI)...
Senior managers in retail industry make important decisions upon assortment planning, product pricin...
In this paper we propose an approach for solving problems of optimal resource capacity allocation to...
International audienceGiven a set of items, each characterized by a profit and a weight, we study th...
Given a set of items with profits and weights and a knapsack capacity, we study the problem of findi...
The concept of priority indices defined to discuss the Restless Bandit Problem (RBP) furnish a relev...
International audienceThis paper solves the binary single-constrained Knapsack Problem (KP) and unde...
We characterize the revenue maximizing policy in the dynamic and stochas-tic knapsack problem where ...
A Knapsack problem is to select among n types of items of various values and weights to fill a knap...
We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capa...
International audienceIn the binary single constraint Knapsack Problem, denoted KP, we are given a k...
URL des Documents de travail :http://mse.univ-paris1.fr/CES2007/2007064B.pdfDocuments de travail du ...