Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201)
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 7577866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem |
scientific article; zbMATH DE number 7577866 |
Statements
Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (English)
0 references
30 August 2022
0 references
cutting stock problem
0 references
guillotine cuts
0 references
constraint programming
0 references
mixed integer linear programming
0 references
optimization
0 references
0 references
0 references
0 references
0.8315098881721497
0 references
0.7982728481292725
0 references
0.7904126644134521
0 references
0.7892628908157349
0 references
