Article ID Journal Published Year Pages File Type
1143266 Operations Research Letters 2006 9 Pages PDF
Abstract

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Simplest optimal cutting patterns for equal rectangles
Authors
,