ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1805.04785
  4. Cited By
An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated
  Multinomial Logit Models
v1v2 (latest)

An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated Multinomial Logit Models

12 May 2018
Xi Chen
Yining Wang
Yuanshuo Zhou
ArXiv (abs)PDFHTML

Papers citing "An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated Multinomial Logit Models"

3 / 3 papers shown
Title
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack
  Constraints
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Xi Chen
Mo Liu
Yining Wang
Yuan Zhou
35
2
0
08 Jul 2024
Adversarial Combinatorial Bandits with General Non-linear Reward
  Functions
Adversarial Combinatorial Bandits with General Non-linear Reward Functions
Xi Chen
Yanjun Han
Yining Wang
71
17
0
05 Jan 2021
Continuous Assortment Optimization with Logit Choice Probabilities under
  Incomplete Information
Continuous Assortment Optimization with Logit Choice Probabilities under Incomplete Information
Yannik Peeters
A. V. D. Boer
Michel Mandjes
51
4
0
17 Jul 2018
1