Some computational results on real 0-1 knapsack problems (Q1079123): Difference between revisions

Recent algorithms for solving the binary knapsack problem employ LP-based or Lagrangean-based reduction schemes to fix a portion of variables. The author suggests a hybrid reduction scheme which employs Lagrangean-based reduction tests on non-pivot variables. Computational results on 110 problems are given demonstrating significant reduction in time over an algorithm which employs a single reduction scheme.