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 this page instead for the normal view: Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem |
scientific article |
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
