Journal
OPERATIONS RESEARCH LETTERS
Volume 37, Issue 4, Pages 230-238Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.03.009
Keywords
Sum-of-ratios; Polynomial-time approximation scheme; Assortment planning
Categories
Funding
- 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
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
