An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model
From MaRDI portal
Publication:6601972
DOI10.1007/S40305-022-00438-0MaRDI QIDQ6601972FDOQ6601972
Authors: Shan Jiang, Kameng Nip
Publication date: 11 September 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Recommendations
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
- Capacitated assortment and price optimization under the multinomial logit model
- Capacitated assortment and price optimization under the multilevel nested logit model
- A survey of assortment optimization problems under logit-based discrete choice models
- Technical note -- Approximation schemes for capacity-constrained assortment optimization under the nested logit model
Quadratic programming (90C20) Fractional programming (90C32) Combinatorial optimization (90C27) Operations research and management science (90B99)
Cites Work
- Title not available (Why is that?)
- Assortment optimization under variants of the nested logit model
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- A column generation algorithm for choice-based network revenue management
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Capacity constraints across nests in assortment optimization under the nested logit model
- A tractable discrete fractional programming: application to constrained assortment optimization
- Capacitated assortment and price optimization under the nested logit model
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
- A nearly instance optimal algorithm for top-\(k\) ranking under the multinomial logit model
Cited In (1)
This page was built for publication: An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601972)