Cutting rectangles avoiding rectangular defects

DOI10.1016/S0893-9659(99)00092-0zbMath0939.65090MaRDI QIDQ1808447

U. Twisselmann

Publication date: 25 November 1999

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

zbMATH Keywords

cutting problemsmaximum empty rectangle problemsteel industry

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• On the maximum empty rectangle problem

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