Article ID: | iaor19961252 |
Country: | Netherlands |
Volume: | 65 |
Issue: | 3 |
Start Page Number: | 362 |
End Page Number: | 367 |
Publication Date: | Mar 1993 |
Journal: | European Journal of Operational Research |
Authors: | Ram Balasubramanian, Chen Chin-Sheng, Sarin Sanjiv |
Keywords: | distribution |
The authors 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. The authors formulate the problem as a mixed-integer non-linear programming problem. They present computational results for two special cases of the general problem that reduce to linear integer programs.