Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Solution of the Rectangular Cutting-Stock Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution approaches to irregular nesting problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4254883 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints / rank | |||
Normal rank | |||
Latest revision as of 20:35, 6 June 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
