A fast algorithm for strongly correlated knapsack problems (Q1281395)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1267551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for strongly correlated knapsack problems |
scientific article; zbMATH DE number 1267551 |
Statements
A fast algorithm for strongly correlated knapsack problems (English)
0 references
22 March 1999
0 references
fixed-charge problem
0 references
memorization
0 references
exact algorithm
0 references
subset-sum problem
0 references
strongly correlated knapsack-problems
0 references
0--1 knapsack problem
0 references
surrogate relaxation
0 references
2-optimal heuristic
0 references
dynamic programming
0 references
0.8593260049819946
0 references
0.8211532831192017
0 references
0.7970424294471741
0 references
0.7936671376228333
0 references
0.7927091717720032
0 references
