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

Chen, CS, Sarin, S, Ram, B. (1993). A mixed-integer programming model for a class of assortment problems . EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 65(3), 362-367. 10.1016/0377-2217(93)90116-5

cited authors

  • Chen, CS; Sarin, S; Ram, B

authors

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. © 1993.

publication date

  • March 26, 1993

published in

Digital Object Identifier (DOI)

start page

  • 362

end page

  • 367

volume

  • 65

issue

  • 3