A PTAS for capacitated sum-of-ratios optimization

Authors:
Paat Rusmevichientong;Zuo-Jun Max Shen;David B. Shmoys
Affiliations:
Cornell University, United States;UC Berkeley, United States;Cornell University, United States
Venue:
Operations Research Letters
Year:
2009

Citing 5
Cited 1

On the Relationship Between Inventory Costs and Variety Benefits in Retailassortments

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Stocking Retail Assortments Under Dynamic Consumer Substitution

Operations Research
Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis

Management Science
On the Choice-Based Linear Programming Model for Network Revenue Management

Manufacturing & Service Operations Management

Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.