Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (Q4530667)
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 1749095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem |
scientific article; zbMATH DE number 1749095 |
Statements
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (English)
0 references
4 June 2002
0 references
0.895155668258667
0 references
0.8737205862998962
0 references
0.8731779456138611
0 references
0.862216055393219
0 references
0.853500485420227
0 references
