期刊
OPERATIONS RESEARCH LETTERS
卷 37, 期 3, 页码 215-218出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.01.007
关键词
Knapsack problem; Bilevel programming; Dynamic programming
资金
- 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
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据