A PTAS for capacitated sum-of-ratios optimization

DOI10.1016/j.orl.2009.03.009zbMath1167.90493OpenAlexW1985447760MaRDI QIDQ833588

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

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.03.009

zbMATH Keywords

polynomial-time approximation schemesum-of-ratiosassortment planning

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30)

Related Items (15)

Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection ⋮ Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model ⋮ Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model ⋮ Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds ⋮ Fractional 0-1 programming and submodularity ⋮ Technical Note—Capacitated Assortment Optimization: Hardness and Approximation ⋮ Assortment optimization with position effects under the nested logit model ⋮ Capacitated assortment and price optimization under the multinomial logit model ⋮ Capacitated strategic assortment planning under explicit demand substitution ⋮ Assortment planning with nested preferences: dynamic programming with distributions as states? ⋮ A greedy algorithm for the two-level nested logit model ⋮ On the sum-product ratio problem and its applications ⋮ Capacitated assortment and price optimization under the multilevel nested logit model ⋮ A PTAS for a class of binary non-linear programs with low-rank functions ⋮ Capacitated assortment and price optimization under the nested logit model

Cites Work

• On the compatibility of nested logit models with utility maximization
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Fractional programming: The sum-of-ratios case
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
• Stocking Retail Assortments Under Dynamic Consumer Substitution
• Combinatorial Optimization with Rational Objective Functions
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A PTAS for capacitated sum-of-ratios optimization