An approximately global optimization method for assortment problems

Han-Lin Li*, Ching Ter Chang

*此作品的通信作者

研究成果: Article同行評審

20 引文 斯高帕斯(Scopus)

摘要

Assortment problems occur when we want to cut a number of small rectangular pieces from a large rectangle to get the minimum area within the rectangle. Recently, Chen et al. proposed a useful model for assortment problems. Although Chen et al.'s model is quite promising to find solutions, there are two inadequacies in their model: firstly, the objective function in their model is a polynomial term, which may not lead to a globally optimal solution; secondly, too many 0-1 variables are used to formulate the non-overlapping constraints. We propose a new method to reformulate an assortment model. Our model is not only able to find the approximately global optimal solution, but involves less 0-1 variables for formulating non-overlapping constraints.

原文English
頁(從 - 到)604-612
頁數9
期刊European Journal of Operational Research
105
發行號3
DOIs
出版狀態Published - 16 3月 1998

指紋

深入研究「An approximately global optimization method for assortment problems」主題。共同形成了獨特的指紋。

引用此