✦ LIBER ✦

Revenue maximization in the dynamic knapsack problem

✍ Scribed by Deniz Dizdar; Alex Gershkov; Benny Moldovanu

Book ID: 119937663
Publisher: The Econometric Society
Year: 2011
Tongue: English
Weight: 269 KB
Volume: 6
Category: Article
ISSN: 1933-6837
DOI: 10.3982/te700

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Dynamic and Stochastic Knapsack Prob

The Dynamic and Stochastic Knapsack Problem

✍ Kleywegt, Anton J.; Papastavrou, Jason D. 📂 Article 📅 1998 🏛 INFORMS 🌐 English ⚖ 333 KB

Upper bounds for revenue maximization in

Upper bounds for revenue maximization in a satellite scheduling problem

✍ Thierry Benoist; Benoít Rottembourg 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 158 KB

Dynamic programming algorithms for the Z

Dynamic programming algorithms for the Zero-One Knapsack Problem

✍ P. Toth 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 786 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the bilevel knapsack problem

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 KB

Dynamic programming approaches to the mu

Dynamic programming approaches to the multiple criteria knapsack problem

✍ Kathrin Klamroth; Margaret M. Wiecek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

Revenue Maximization in Time-Varying Mul

Revenue Maximization in Time-Varying Multi-Hop Wireless Networks: A Dynamic Pricing Approach

✍ Song, Yang; Zhang, Chi; Fang, Yuguang; Lin, Phone 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 420 KB