Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
1999; Institute for Operations Research and the Management Sciences; Volume: 45; Issue: 3 Linguagem: Inglês
10.1287/mnsc.45.3.414
ISSN1526-5501
AutoresSilvano Martello, David Pisinger, Paolo Toth,
Tópico(s)Advanced Manufacturing and Logistics Optimization
ResumoTwo new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in addition, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted. The algorithm is able to solve all classical test instances, with up to 10,000 variables, in less than 0.2 seconds on a HP9000-735/99 computer. The C language implementation of the algorithm is available on the internet.
Referência(s)