Assortment planning with nested preferences: dynamic programming with distributions as states?
From MaRDI portal
Publication:1755798
DOI10.1007/s00453-018-0450-5zbMath1415.90142OpenAlexW3123494325WikidataQ129845725 ScholiaQ129845725MaRDI QIDQ1755798
Publication date: 11 January 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-018-0450-5
Related Items (3)
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice ⋮ An optimal stocking problem to minimize the expected time to sellout ⋮ Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A PTAS for capacitated sum-of-ratios optimization
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
- 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
- Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
- Assortment Planning and Inventory Decisions Under a Locational Choice Model
- Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Inventory Competition Under Dynamic Consumer Choice
- Centralized and Competitive Inventory Models with Demand Substitution
- New product introduction against a predator: A bilevel mixed-integer programming approach
- On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
- The Approximability of Assortment Optimization Under Ranking Preferences
This page was built for publication: Assortment planning with nested preferences: dynamic programming with distributions as states?