The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing

The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variation of the model has become a basic tool in studying problems that arise in revenue management and dynamic/flexible pricing; and it is in this context that our study is undertaken. Based on a dynamic programming formul...

متن کامل

The Dynamic and Stochastic Knapsack Problem

The Dynamic and Stochastic Knapsack Problem (DSKP) is de ned as follows: Items arrive according to a Poisson process in time. Each item has a demand (size) for a limited resource (the knapsack) and an associated reward. The resource requirements and rewards are jointly distributed according to a known probability distribution and become known at the time of the item's arrival. Items can be eith...

متن کامل

The Dynamic and Stochastic Knapsack Problem with Deadlines yJason

In this paper a dynamic and stochastic model of the well-known knapsack problem is developed and analyzed. The problem is motivated by a wide variety of real-world applications. Objects of random weight and reward arrive according to a stochastic process in time. The weights and rewards associated with the objects are distributed according to a known probability distribution. Each object can ei...

متن کامل

Negotiating SLAs with Dynamic Pricing Policies

This position paper argues for research in the development of focused solutions for dynamic pricing, service-level agreements and negotiation for eServices in a digital economy. Thereby the authors have a main focus on the development of an independent negotiation protocol, which satisfies the needs and preferences of customers and service providers, also with a certain focus on legal aspects o...

متن کامل

Approximating the solution of a dynamic , stochastic multiple knapsack problem

We model an environment where orders arrive probabilistically over time, with their revenues and capacity requirements becoming known upon arrival. The decision is whether to accept an order, receiving a reward and reserving capacity, or reject an order, freeing capacity for possible future arrivals. We model the dynamic, stochastic multiple knapsack problem (DSMKP) with stochastic dynamic prog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2008

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.1080.0555