A dynamic programming algorithm for the bilevel knapsack problem

Authors:
Luce Brotcorne;SaïD Hanafi;RaïD Mansi
Affiliations:
LAMIH-ROI, ISTV2, UVHC-Le Mont Houy, 59313 Valenciennes cedex9, France;LAMIH-ROI, ISTV2, UVHC-Le Mont Houy, 59313 Valenciennes cedex9, France;LAMIH-ROI, ISTV2, UVHC-Le Mont Houy, 59313 Valenciennes cedex9, France
Venue:
Operations Research Letters
Year:
2009

Citing 2
Cited 4

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science

Approximation algorithms for a bi-level knapsack problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
The bilevel knapsack problem with stochastic right-hand sides

Operations Research Letters
A complexity and approximability study of the bilevel knapsack problem

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for a bi-level knapsack problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.