On the effectivity of gradient methods for cutting stock problems (Q1342431)
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: On the effectivity of gradient methods for cutting stock problems |
scientific article; zbMATH DE number 710440
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the effectivity of gradient methods for cutting stock problems |
scientific article; zbMATH DE number 710440 |
Statements
On the effectivity of gradient methods for cutting stock problems (English)
0 references
11 January 1995
0 references
packing
0 references
knapsack
0 references
greedy algorithm
0 references
one, two and three dimensional cutting stock
0 references
worst case bound
0 references
time complexity
0 references
exact polynomial time algorithm
0 references
