Some computational results on real 0-1 knapsack problems (Q1079123)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some computational results on real 0-1 knapsack problems |
scientific article; zbMATH DE number 3961345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some computational results on real 0-1 knapsack problems |
scientific article; zbMATH DE number 3961345 |
Statements
Some computational results on real 0-1 knapsack problems (English)
0 references
1986
0 references
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.
0 references
binary knapsack problem
0 references
hybrid reduction scheme
0 references
Lagrangean-based reduction tests
0 references
0.9468976
0 references
0.9049034
0 references
0.90381706
0 references
0.89869475
0 references
0.8980218
0 references
0.8972337
0 references
0.8950604
0 references
0.89388585
0 references
