| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143109 | Operations Research Letters | 2009 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys,