A hybrid algorithm for the unbounded knapsack problem

  • Authors:

  • Vincent Poirriez;Nicola Yanev;Rumen Andonov

  • Affiliations:

  • LAMIH/ROI UMR CNRS 8530, University of Valenciennes, Le Mont Houy, 59313 Valenciennes Cedex 9, France;Faculty of Mathematics and Informatics, University of Sofia, 1164 Sofia, 5 James Bourchier Blvd., Bulgaria and Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, "Acad. G. Bo ...;INRIA Rennes-Bretagne Atlantique and University of Rennes 1, Campus de Beaulieu, 35042 Rennes Cedex, France

  • Venue:
  • Discrete Optimization
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new approach for exactly solving the Unbounded Knapsack Problem (UKP) and proposes a new bound that was proved to dominate the previous bounds on a special class of UKP instances. Integrating bounds within the framework of sparse dynamic programming led to the creation of an efficient and robust hybrid algorithm, called EDUK2. This algorithm takes advantage of the majority of the known properties of UKP, particularly the diverse dominance relations and the important periodicity property. Extensive computational results show that, in all but a very few cases, EDUK2 significantly outperforms both MTU2 and EDUK, the currently available UKP solvers, as well the well-known general purpose mathematical programming optimizer CPLEX of ILOG. These experimental results demonstrate that the class of hard UKP instances needs to be redefined, and the authors offer their insights into the creation of such instances.