Pages that link to "Item:Q3098330"

The following pages link to Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint (Q3098330):

Displaying 24 items.

• Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
• Robust Learning of Consumer Preferences (Q5080653) (← links)
• Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues (Q5084101) (← links)
• Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information (Q5095163) (← links)
• Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays (Q5106360) (← links)
• Tractable Approximations for Assortment Planning with Product Costs (Q5126613) (← links)
• Technical Note—Assortment Optimization with Small Consideration Sets (Q5129194) (← links)
• MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
• Approximation Algorithms for Product Framing and Pricing (Q5130488) (← links)
• Assortment Optimization Under the Paired Combinatorial Logit Model (Q5130506) (← links)
• Pricing and Assortment Strategies with Product Exchanges (Q5131469) (← links)
• The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• (Q5149014) (← links)
• Joint location and cost planning in maximum capture facility location under random utilities (Q6047876) (← links)
• Stochastic approximation for uncapacitated assortment optimization under the multinomial logit model (Q6051595) (← links)
• Constrained multi‐location assortment optimization under the multinomial logit model (Q6057030) (← links)
• Assortment optimization with position effects under the nested logit model (Q6057929) (← links)
• Data‐driven research in retail operations—A review (Q6072168) (← links)
• Callable products with dependent demands (Q6093549) (← links)
• A gradient descent method for estimating the Markov chain choice model (Q6097386) (← links)
• A tractable online learning algorithm for the multinomial logit contextual bandit (Q6113379) (← links)
• Multi-plant manufacturing assortment planning in the presence of transshipments (Q6113449) (← links)
• A confirmation of a conjecture on Feldman’s two-armed bandit problem (Q6198964) (← links)