Simplest optimal cutting patterns for equal rectangles
type: Item
instance of: scholarly article
title: Simplest optimal cutting patterns for equal rectangles
zbMATH Open document ID: 1112.90100
author: Yaodong Cui
published in: Operations Research Letters
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5128054
zbMATH Keywords: cutting stock problem
zbMATH Keywords: optimization
zbMATH Keywords: two-dimensional cutting
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.orl.2005.10.007
OpenAlex ID: W2024470714
cites work: Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
cites work: Unbounded knapsack problem: Dynamic programming revisited
cites work: Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
cites work: Generating optimal cutting patterns for rectangular blanks of a single size
cites work: A typology of cutting and packing problems
cites work: Q4821303
cites work: An application of simulated annealing to the cutting stock problem
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
cites work: A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
DOI: 10.1016/J.ORL.2005.10.007
description: scientific article; zbMATH DE number 5128054