Documentation scienceplus.abes.fr version Bêta

À propos de : Integer Programming Formulation of the Bilevel Knapsack Problem        

AttributsValeurs
type
Is Part Of
Subject
Title
  • Integer Programming Formulation of the Bilevel Knapsack Problem
Date
has manifestation of work
related by
Author
Editor
Abstract
  • 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 integer program reformulation is equivalent to the BKP. Numerical results show the efficiency of our method compared with those obtained by the algorithm of Moore and Bard.
article type
publisher identifier
  • mmnp201057Sp116
Date Copyrighted
Rights
  • © EDP Sciences, 2010
Rights Holder
  • EDP Sciences
is part of this journal
is primary topic of



Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata