A new upper bound for unconstrained two-dimensional cutting and packing

Y-G G () and Kang M-K
Additional contact information
Y-G G: Hanyang University, Ansan
Kang M-K: Hanyang University, Ansan

Journal of the Operational Research Society, 2002, vol. 53, issue 5, 587-591

Abstract: Abstract A new upper bound for the unconstrained two-dimensional cutting or packing problem is proposed in this paper. The proposed upper bound can be calculated for any size of plate by solving just two knapsack problems at the beginning of the algorithm. In this research, the proposed upper bound was applied to the well known exact cutting algorithm, although it can be used for both cutting and packing applications. The experimental results demonstrate that the new upper bound is very efficient, and reduces the search time required to find an optimal solution.

Keywords: cutting stock problem; optimisation; upper bound; two-dimensional packing (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601326 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:5:d:10.1057_palgrave.jors.2601326

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601326

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().