Simplest optimal cutting patterns for equal rectangles

Authors:
Yaodong Cui
Affiliations:
Department of Computer Science, Guangxi Normal University, Guilin 541004, China
Venue:
Operations Research Letters
Year:
2006

Citing 2
Cited 0

Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem

Computers and Industrial Engineering
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.