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 QIDQ6601972
Publication date: 11 September 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Quadratic programming (90C20) Fractional programming (90C32) Combinatorial optimization (90C27) Operations research and management science (90B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch-and-cut algorithm for the latent-class logit assortment problem
- A tractable discrete fractional programming: application to constrained assortment optimization
- Capacitated assortment and price optimization under the nested logit model
- 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
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model
Related Items (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)
