Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198)
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: Computational experience with a core-based reduction procedure for the 2-knapsack problem |
scientific article; zbMATH DE number 5800838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational experience with a core-based reduction procedure for the 2-knapsack problem |
scientific article; zbMATH DE number 5800838 |
Statements
Computational experience with a core-based reduction procedure for the 2-knapsack problem (English)
0 references
15 October 2010
0 references
two-constraint knapsack
0 references
reduction procedure
0 references
core problem
0 references
0.7816228866577148
0 references
0.7748945355415344
0 references
0.7748789191246033
0 references
0.7706582546234131
0 references
0.7661221623420715
0 references
