Distribution-specific approximation guarantees for the random-parameters logit assortment problem
From MaRDI portal
Cites work
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A choice-based optimization approach for contracting in supply chains
- A column generation algorithm for choice-based network revenue management
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- A one-sided Vysochanskii-Petunin inequality with financial applications
- Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
- Bayesian analysis of random coefficient logit models using aggregate data
- Customer choice models vs. machine learning: finding optimal product displays on Alibaba
- Discrete Choice Methods with Simulation
- Easy and flexible mixture distributions
- Forecasting new product penetration with flexible substitution patterns
- scientific article; zbMATH DE number 3642525 (Why is no real title available?)
- Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments
- Multivariate Chebyshev Inequalities
- On the product portfolio planning problem with customer-engineering interaction
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
This page was built for publication: Distribution-specific approximation guarantees for the random-parameters logit assortment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234000)
