✦ LIBER ✦

An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

✍ Scribed by Bertsimas, Dimitris; Demir, Ramazan

Book ID: 125848410
Publisher: INFORMS
Year: 2002
Tongue: English
Weight: 283 KB
Volume: 48
Category: Article
ISSN: 0025-1909
DOI: 10.1287/mnsc.48.4.550.208

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximate dynamic programming appro

An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem

✍ Thomas C. Perry; Joseph C. Hartman 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

A fuzzy programming approach to multiobj

A fuzzy programming approach to multiobjective multidimensional 0–1 knapsack problems

✍ N.J. Abboud; M. Sakawa; M. Inuiguchi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 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

An approximate dynamic programming appro

An approximate dynamic programming approach to solving dynamic oligopoly models

✍ Vivek Farias; Denis Saure; Gabriel Y. Weintraub 📂 Article 📅 2012 🏛 The RAND Corporation 🌐 English ⚖ 816 KB

An approximate dynamic programming based

An approximate dynamic programming based approach to dual adaptive control

✍ Jong Min Lee; Jay H. Lee 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 282 KB

A Semidefinite Programming Approach to t

A Semidefinite Programming Approach to the Quadratic Knapsack Problem

✍ C. Helmberg; F. Rendl; R. Weismantel 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 101 KB