A PTAS for capacitated sum-of-ratios optimization

作     者：Rusmevichientong, Paat Shen, Zuo-Jun Max Shmoys, David B. 

作者机构：Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14853 USA UC Berkeley Berkeley CA USA 

出 版 物：《OPERATIONS RESEARCH LETTERS》 (运筹学快报)

年 卷 期：2009年第37卷第4期

页      面：230-238页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：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 Funding Source: National Science Foundation Div Of Civil, Mechanical, & Manufact Inn Directorate For Engineering [0746844, 1158659] Funding Source: National Science Foundation 

主　　题：Sum-of-ratios Polynomial-time approximation scheme Assortment planning 

摘      要：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.