The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (Q1357487)
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 1019523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool |
scientific article; zbMATH DE number 1019523 |
Statements
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (English)
0 references
10 June 1997
0 references
implicit enumeration
0 references
size reduction
0 references
bidimensional knapsack
0 references
heuristic approach
0 references
surrogate duality
0 references
0.8303016424179077
0 references
0.8268985152244568
0 references
0.815373420715332
0 references
0.8152801394462585
0 references
