Assortment optimization over time
From MaRDI portal
Publication:1785447
DOI10.1016/J.ORL.2015.08.007zbMath1408.90304OpenAlexW2157089297MaRDI QIDQ1785447
Huseyin Topaloglu, David P. Williamson, James M. Davis
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2015.08.007
Related Items (3)
Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays ⋮ Approximation Algorithms for Product Framing and Pricing ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
Cites Work
- Approximating min sum set cover
- Assortment Optimization Under Variants of the Nested Logit Model
- A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- Learning Consumer Tastes Through Dynamic Assortments
- A threshold of ln n for approximating set cover
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- An analysis of approximations for maximizing submodular set functions—I
This page was built for publication: Assortment optimization over time
