Two 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.
No takes yet. Share an insight, caveat, or question.
Martello et al. (1999) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: