Upper bounds for the homogeneous case of a two-dimensional packing problem

Abstract

A method for determining an upper bound for the homogeneous case of a two-dimensional packing problem is presented in this paper. It is based on an analysis of the problem's structure and can be evaluated as the optimal solution of a non-convex minimization problem which can be transformed to a piecewise linear problem by using its special properties. Finally a comparative analysis of solution quality and time complexity is presented.