A fast algorithm for assortment optimization problems

Han-Lin Li*, Jung Fa Tsai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


Assortment optimization problems intend to seek the best way of placing a given set of rectangles within a minimum-area rectangle. Such problems are often formulated as a quadratic mixed 0-1 program. Many current methods for assortment problems are either unable to find an optimal solution or being computationally ineffecient for reaching an optimal solution. This paper proposes a new method which finds the optimum of assortment problem by solving few linear mixed 0-1 programs. Numerical examples show that the proposed method is more computationally efficient than current methods.

Original languageEnglish
Pages (from-to)1245-1252
Number of pages8
JournalComputers and Operations Research
Issue number12
StatePublished - Oct 2001


  • Assortment
  • Cutting
  • Optimization


Dive into the research topics of 'A fast algorithm for assortment optimization problems'. Together they form a unique fingerprint.

Cite this