Pages that link to "Item:Q5219727"
From MaRDI portal
The following pages link to Approximation Algorithms for Dynamic Assortment Optimization Models (Q5219727):
Displaying 8 items.
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution (Q322508) (← links)
- In-out algorithm for assortment planning under a ranking-based consumer choice model (Q2183213) (← links)
- An optimal stocking problem to minimize the expected time to sellout (Q2661592) (← links)
- Fast Approximation Methods for Sales Force Deployment (Q3116700) (← links)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios (Q5144796) (← links)
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)
- Assortment optimization: a systematic literature review (Q6667801) (← links)