Bilevel Knapsack with interdiction constraints

A. Caprara, M. Carvalho, A. Lodi, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

57 Citations (Scopus)
2 Downloads (Pure)


We consider a bilevel integer programming model that extends the classic 0-1 knapsack problem in a very natural way. The model describes a Stackelberg game where the leader's decision interdicts a subset of the knapsack items for the follower. As this interdiction of items substantially increases the difficulty of the problem, it prevents the application of the classical methods for bilevel programming and of the specialized approaches that are tailored to other bilevel knapsack variants. Motivated by the simple description of the model, by its complexity, by its economic applications, and by the lack of algorithms to solve it, we design a novel viable way for computing optimal solutions. Finally, we present extensive computational results that show the effectiveness of the new algorithm on instances from the literature and on randomly generated instances.

Original languageEnglish
Pages (from-to)319-333
Number of pages15
JournalINFORMS Journal on Computing
Issue number2
Publication statusPublished - 1 Mar 2016


  • Bilevel programming
  • Knapsack problem
  • Min-max problem History


Dive into the research topics of 'Bilevel Knapsack with interdiction constraints'. Together they form a unique fingerprint.

Cite this