Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts

DOI10.1016/0377-2217(93)90130-FzbMath0776.90061OpenAlexW1982458653MaRDI QIDQ684319

Praveen Kumar Agrawal

Publication date: 14 September 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90130-f

zbMATH Keywords

branch-and-boundknapsackcuttingorthogonal guillotine cutsrectangular sheettrim loss

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

A simple algorithm for generating optimal equal circle cutting patterns with minimum sections ⋮ Simplest optimal cutting patterns for equal rectangles ⋮ Simplest optimal guillotine cutting patterns for strips of identical circles ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Concurrent engineering in a high variety label printing environment ⋮ A bi-objective guillotine cutting problem of stamping strips of equal circles ⋮ Dynamic programming algorithms for the optimal cutting of equal rectangles ⋮ Dynamic programming algorithms for generating optimal strip layouts

Cites Work

• The trim-loss and assortment problems: A survey
• An exact algorithm for the pallet loading problem
• Practical Considerations of the Pallet-Loading Problem
• Unnamed Item

This page was built for publication: Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts