𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic programming algorithm for the bilevel knapsack problem

✍ Scribed by Luce Brotcorne; Saïd Hanafi; Raïd Mansi

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
940 KB
Volume
37
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the discrete bilevel pr
An algorithm for the discrete bilevel programming problem
✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

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