.png){kind=icon}
Return
Approximately global optimization for assortment problems using piecewise linearization techniques
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00194-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, Li and Chang proposed an approximate model for assortment problems. Although their model is quite promising to find approximately global solution, too many 0-1 variables are required in their solution process. This paper proposes another way for solving the same problem. The proposed method uses iteratively a technique of piecewise linearization of the quadratic objective function. Numerical examples demonstrate that the proposed method is computationally more efficient than the Li and Chang method. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
cutting
assortment
global optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
.png){kind=icon}
