A mixed-integer programming model for a class of assortment problems

A mixed-integer programming model for a class of assortment problems

0.00 Avg rating0 Votes
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: , ,
Keywords: distribution
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.