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. 2407.05564
  4. Cited By
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack
  Constraints

A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints

8 July 2024
Xi Chen
Mo Liu
Yining Wang
Yuan Zhou
ArXiv (abs)PDFHTML

Papers citing "A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints"

1 / 1 papers shown
Title
Learning an Optimal Assortment Policy under Observational Data
Learning an Optimal Assortment Policy under Observational Data
Yuxuan Han
Han Zhong
Miao Lu
Jose H. Blanchet
Zhengyuan Zhou
OffRL
131
0
0
10 Feb 2025
1