Solving nesting problems with non‐convex polygons by constraint logic programming
Work
Year: 2003
Type: article
Abstract: In this paper an application of constraint logic programming (CLP) to the resolution of nesting problems is presented. Nesting problems are a special case of the cutting and packing problems, in whic... more
Institution Universidade do Porto
Cites: 19
Cited by: 41
Related to: 10
FWCI: 3.198
Citation percentile (by year/subfield): 92.97
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green