An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219)
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: An approximation algorithm for solving unconstrained two-dimensional knapsack problems |
scientific article; zbMATH DE number 1189578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for solving unconstrained two-dimensional knapsack problems |
scientific article; zbMATH DE number 1189578 |
Statements
An approximation algorithm for solving unconstrained two-dimensional knapsack problems (English)
0 references
13 August 1998
0 references
cutting stock
0 references
heuristic
0 references
two-dimensional knapsack problems
0 references
0 references
0 references
0.95258707
0 references
0.9413683
0 references
0.9413683
0 references
0.93936265
0 references
0.9320956
0 references
0.93000126
0 references
0.9281908
0 references
0.9206795
0 references
0.91801435
0 references
0.91321826
0 references
