Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/1475-3995.00434 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007670071 / rank | |||
Normal rank | |||
Revision as of 21:46, 19 March 2024
scientific article; zbMATH DE number 2097784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving nesting problems with non-convex polygons by constraint logic programming |
scientific article; zbMATH DE number 2097784 |
Statements
Solving nesting problems with non-convex polygons by constraint logic programming (English)
0 references
7 September 2004
0 references
packing
0 references
nofit polygon
0 references
