Technical Note—Capacitated Assortment Optimization: Hardness and Approximation

DOI10.1287/opre.2021.2142zbMath1494.90042OpenAlexW3207043624MaRDI QIDQ5080651

Vineet Goyal, Antoine Désir, Jia-Wei Zhang

Publication date: 31 May 2022

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

Full work available at URL: https://doi.org/10.1287/opre.2021.2142

zbMATH Keywords

assortment optimizationFPTASchoice modelsrevenue management and market analytics

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05) Marketing, advertising (90B60)

Related Items (2)

Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model ⋮ Assortment optimization using an attraction model in an omnichannel environment

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for the latent-class logit assortment problem
• Capacitated assortment and price optimization under the nested logit model
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• A PTAS for capacitated sum-of-ratios optimization
• Capacitated assortment and price optimization under the multilevel nested logit model
• A Markov Chain Approximation to Choice Modeling
• Assortment Optimization Under Variants of the Nested Logit Model
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• A Column Generation Algorithm for Choice-Based Network Revenue Management
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• The d-Level Nested Logit Model: Assortment and Price Optimization Problems
• Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
• Revenue Management Under the Markov Chain Choice Model
• Reducibility among Combinatorial Problems
• The Approximability of Assortment Optimization Under Ranking Preferences
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
• Revenue Management for Parallel Flights with Customer-Choice Behavior

This page was built for publication: Technical Note—Capacitated Assortment Optimization: Hardness and Approximation