Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps

Keyphrases

• Approximation Algorithms 100%
• Assortment Optimization 100%
• Maximum Load 100%
• Adaptivity Gap 100%
• Optimization Problem 40%
• Decision Maker 40%
• Number of Customers 40%
• Expected Maxima 40%
• Dynamic Formulation 40%
• Adaptation Policy 20%
• Novel Class 20%
• Computational Challenges 20%
• Algorithmic Approach 20%
• Mation 20%
• Polynomial-time Approximation Scheme 20%
• Customer Focus 20%
• Multinomial Logit Choice Model 20%
• Near-optimal 20%
• Problem Formulation 20%
• Quasi-polynomial Time 20%
• Dynamic Setting 20%
• Preference-based 20%
• Random Loading 20%
• Dynamic Assortments 20%
• Substitutable Products 20%
• Challenge Questions 20%
• Assortment Policy 20%
• Attended Home Delivery 20%
• Static Problem 20%
• Home Preferences 20%
• Analytical Questions 20%

Computer Science

• Optimization Problem 100%
• Polynomial Time 100%
• Approximation Algorithms 100%
• Decision Maker 100%
• Approximation (Algorithm) 50%
• Time Approximation Scheme 50%
• Constant Factor 50%
• Algorithmic Approach 50%
• Problem Formulation 50%
• Random Loads 50%