Computational experience with a core-based reduction procedure for the 2-knapsack problem

摘要

In this note we consider the 2-knapsack problem where each item has both a weight and a size. We show that a simple yet powerful reduction procedure can significantly enhance the capabilities of a commercial ILP solver, leading to solve very large instances.