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.
Computational experience with a core-based reduction procedure for the2-knapsack problem
GROSSO, Andrea Cesare
2011-01-01
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
