The Approximability of Assortment Optimization Under Ranking Preferences
From MaRDI portal
Publication:5131544
DOI10.1287/opre.2018.1754zbMath1446.90094OpenAlexW3121891820WikidataQ128904474 ScholiaQ128904474MaRDI QIDQ5131544
Danny Segev, Ali Aouad, Vivek Francis Farias, Retsef Levi
Publication date: 8 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://lbsresearch.london.edu/id/eprint/1085/1/Approx_Aouad_OR.pdf
independent setapproximation algorithmsassortment optimizationhardness of approximationchoice models
Management decision making, including multiple objectives (90B50) Consumer behavior, demand theory (91B42)
Related Items (10)
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice ⋮ Robust assortment optimization under sequential product unavailability ⋮ Technical Note—Capacitated Assortment Optimization: Hardness and Approximation ⋮ In-out algorithm for assortment planning under a ranking-based consumer choice model ⋮ Data‐driven research in retail operations—A review ⋮ Exact First-Choice Product Line Optimization ⋮ An exact column-generation approach for the lot-type design problem ⋮ Assortment planning with nested preferences: dynamic programming with distributions as states? ⋮ Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments ⋮ Approximation Algorithms for Dynamic Assortment Optimization Models
Cites Work
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Approximating the independence number via the \(\vartheta\)-function
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
- 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
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- A Nonparametric Approach to Multiproduct Pricing
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- The d-Level Nested Logit Model: Assortment and Price Optimization Problems
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Approximate graph coloring by semidefinite programming
- Technical Note—Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets
- Technical Note—An Expectation-Maximization Method to Estimate a Rank-Based Choice Model of Demand
- Automata, Languages and Programming
This page was built for publication: The Approximability of Assortment Optimization Under Ranking Preferences
