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

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.
38
514
516
F. Della Croce; A. Grosso
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2318/78300
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact