Two-stage general block patterns for the two-dimensional cutting problem

This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required to cut the blocks into pieces. Firstly verti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2007-10, Vol.34 (10), p.2882-2893
Hauptverfasser:	Cui, Yaodong, Zhang, Xianquan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Cutting stock Cutting stock problem Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Studies Unconstrained two-dimensional cutting
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!