Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization.
Aadirupa SahaPierre GaillardPublished in: CoRR (2024)
Keyphrases
- approximately optimal
- optimization problems
- computationally demanding
- discrete optimization
- highly efficient
- computationally efficient
- computationally intensive
- optimization methods
- benchmark datasets
- computationally expensive
- complexity analysis
- joint optimization
- orders of magnitude
- theoretical analysis
- efficient optimization
- worst case
- computational cost
- optimal selection
- computationally complex
- exhaustive search
- global optimization
- highly scalable
- practical problems
- optimization procedure
- efficient implementation
- data sets
- combinatorial optimization
- optimization algorithm
- supply chain
- significant improvement
- data structure
- objective function
- learning algorithm