Cutting rectangles avoiding rectangular defects

DOI10.1016/S0893-9659(99)00092-0MaRDI QIDQ1808447zbMATH OpenFDO

Authors U. Twisselmann

Publication date 25 November 1999

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0893-9659(99)00092-0

zbMATH Keywords

cutting problemsmaximum empty rectangle problemsteel industry

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• Cutting polygons composed of equal rectangles into similar rectangles
• Optimal cutting directions and rectangle orientation algorithm
• Cuttings for Disks and Axis-Aligned Rectangles
• Rectilinear glass-cut dissections of rectangles to squares
• Simplest optimal cutting patterns for equal rectangles
• Cutting circles and polygons from area-minimizing rectangles
• Recuttings of polygons
• Rectangling a rectangle
• scientific article; zbMATH DE number 2146649

Cites work

• On the maximum empty rectangle problem

Cited in

(4)

• Solving a large cutting problem in the glass manufacturing industry
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
• Cuttings for Disks and Axis-Aligned Rectangles
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects

This page was built for publication: Cutting rectangles avoiding rectangular defects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808447)