Some computational results on real 0-1 knapsack problems

  • Authors:

  • Richard A. Murphy

  • Affiliations:

  • Optimal Decision Systems Inc., Cincinnati, OH 45242, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

The most recent algorithms to solve binary knapsack problems employ Lagrangean based reduction schemes to fix on or off a significant portion of the variables. This paper points out that, on hard problems encountered in practice, the repeated. application of an LP-based reduction on the pivot variable can greatly shorten solution times