Knapsack

A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints

The price-elastic knapsack problem

This paper introduces the price-elastic knapsack problem (PEKP), an extension of the classic knapsack problem where instead of fixed item characteristics, the weight of each item and the profit from including an item in the knapsack are a function of …

A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints

We consider the bilevel knapsack problem with interdiction constraints, a fundamental bilevel integer programming problem which generalizes the 0-1 knapsack problem. In this problem, there are two knapsacks and n items. The objective is to select …

On the exact separation of mixed-integer knapsack cuts

Add the full text or supplementary notes for the publication here using Markdown formatting.