Article ID Journal Published Year Pages File Type
1142844 Operations Research Letters 2009 4 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A dynamic programming algorithm for the bilevel knapsack problem
Authors
, , ,