One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576)
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: One-dimensional cutting stock problem to minimize the number of different patterns |
scientific article; zbMATH DE number 1896848
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-dimensional cutting stock problem to minimize the number of different patterns |
scientific article; zbMATH DE number 1896848 |
Statements
One-dimensional cutting stock problem to minimize the number of different patterns (English)
0 references
10 April 2003
0 references
cutting stock problem
0 references
pattern minimization
0 references
local search
0 references
metaheuristics
0 references
pattern generation
0 references
0.9370029
0 references
0.9134416
0 references
0 references
0.89076614
0 references
0.8901914
0 references
0 references
0.88222486
0 references
0.88168806
0 references
