A dynamic programming algorithm for the bilevel knapsack problem |
| |
Authors: | Luce Brotcorne |
| |
Affiliation: | LAMIH-ROI, ISTV2, UVHC-Le Mont Houy, 59313 Valenciennes cedex9, France |
| |
Abstract: | We propose an efficient dynamic programming algorithm for solving a bilevel program where the leader controls the capacity of a knapsack, and the follower solves the resulting knapsack problem. We propose new recursive rules and show how to solve the problem as a sequence of two standard knapsack problems. |
| |
Keywords: | Knapsack problem Bilevel programming Dynamic programming |
本文献已被 ScienceDirect 等数据库收录! |