Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-319-42902-1_10 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2594482692 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:23, 19 March 2024
scientific article; zbMATH DE number 6814362
Language | Label | Description | Also known as |
---|---|---|---|
English | Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem |
scientific article; zbMATH DE number 6814362 |
Statements
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (English)
0 references
1 December 2017
0 references