Journal
OPERATIONS RESEARCH LETTERS
Volume 37, Issue 3, Pages 215-218Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.01.007
Keywords
Knapsack problem; Bilevel programming; Dynamic programming
Categories
Funding
- International Campus on Safety and Intermodality in Transportation
- Nord-Pas-de-Calais Region
- European Community
- Regional Delegation for Research and Technology
- Ministry of Higher Education and Research
- National Center for Scientific Research
Ask authors/readers for more resources
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. (C) 2009 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
