A fast algorithm for assortment optimization problems
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1252 | en_US |
dc.citation.issue |
12 | en_US |
dc.citation.spage |
1245 | en_US |
dc.citation.volume |
28 | en_US |
dc.citation.woscount |
6 | |
dc.contributor.author |
Li, HL | en_US |
dc.contributor.author |
Tsai, JF | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:43:24Z | |
dc.date.available |
2014-12-08T15:43:24Z | |
dc.date.issued |
2001-10-01 | en_US |
dc.description.abstract |
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 inefficient 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. | en_US |
dc.identifier.doi |
10.1016/S0305-0548(00)00035-6 | en_US |
dc.identifier.issn |
0305-0548 | en_US |
dc.identifier.journal |
COMPUTERS & OPERATIONS RESEARCH | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0305-0548(00)00035-6 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29377 | |
dc.identifier.wosnumber |
WOS:000170418600007 | |
dc.language.iso |
en_US | en_US |
dc.subject |
assortment | en_US |
dc.subject |
cutting | en_US |
dc.subject |
optimization | en_US |
dc.title |
A fast algorithm for assortment optimization problems | en_US |
dc.type |
Article | en_US |
檔案
- 000170418600007.pdf (98.4 KB, Adobe PDF)
所屬典藏: 期刊論文