Implantation et complexité des techniques de programmation dynamique dans les méthodes de confection de tournées et d'horaires
Integer Programming Formulation of the Bilevel Knapsack Problem
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that the...