A mixed-integer programming model for a class of assortment problems
暂无分享,去创建一个
Abstract We consider the problem of placing a set of rectangles of different sizes, in a non-overlapping fashion, within a large rectangle of minimum area. This general problem has several practical applications in location of departments in a minimum area and in two dimensional stock-cutting with the objective of keeping trim-loss at a minimum. We formulate the problem as a mixed-integer non-linear programming problem. We present computational results for two special cases of the general problem that reduce to linear integer programs.
[1] E. Page,et al. A Note on a Two-dimensional Dynamic Programming Problem , 1975 .
[2] M. L. Chambers,et al. The Cutting Stock Problem in the Flat Glass Industry - Selection of Stock Sizes , 1976 .
[3] J. Beasley. An algorithm for the two-dimensional assortment problem , 1985 .
[4] A. I. Hinxman. The trim-loss and assortment problems: A survey , 1980 .