期刊
OPERATIONS RESEARCH LETTERS
卷 37, 期 4, 页码 230-238出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.03.009
关键词
Sum-of-ratios; Polynomial-time approximation scheme; Assortment planning
资金
- National Science Foundation [DMS-0732196, CMMI-0746844, CMMI-0621433, CCR-0635121, CMMI-0727640]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [0832782] Funding Source: National Science Foundation
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [0746844, 1158659] Funding Source: National Science Foundation
Motivated by an application in assortment planning under the nested logit choice model, we develop a polynomial-time approximation scheme for the sum-of-ratios optimization problem with a capacity constraint and a fixed number of product groups. (C) 2009 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
