Some computational results on real 0-1 knapsack problems (Q1079123): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90105-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029234384 / rank | |||
Normal rank | |||
Revision as of 00:35, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some computational results on real 0-1 knapsack problems |
scientific article |
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
