Pages that link to "Item:Q5131544"
From MaRDI portal
The following pages link to The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544):
Displaying 13 items.
- Assortment planning with nested preferences: dynamic programming with distributions as states? (Q1755798) (← links)
- An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
- Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
- In-out algorithm for assortment planning under a ranking-based consumer choice model (Q2183213) (← links)
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
- Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
- Exact First-Choice Product Line Optimization (Q5126626) (← links)
- Approximation Algorithms for Dynamic Assortment Optimization Models (Q5219727) (← links)
- Data‐driven research in retail operations—A review (Q6072168) (← links)
- An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem (Q6495397) (← links)
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)
- Pricing heterogeneous products to heterogeneous customers who buy sequentially (Q6638856) (← links)
