Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model
From MaRDI portal
Publication:4971390
DOI10.1287/opre.2017.1703zbMath1455.90109arXiv1705.09040MaRDI QIDQ4971390
Atamtürk, Alper, Alper Şen, Philip M. Kaminsky
Publication date: 12 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09040
Related Items
Data-Driven Optimization of Reward-Risk Ratio Measures, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Pricing for a product with network effects and mixed logit demand, Constrained multi‐location assortment optimization under the multinomial logit model, Data‐driven research in retail operations—A review, Multi-plant manufacturing assortment planning in the presence of transshipments, Exact approaches for competitive facility location with discrete attractiveness, Alternate solution approaches for competitive hub location problems, A choice-based optimization approach for contracting in supply chains, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Boosting evolutionary algorithm configuration, Capacitated strategic assortment planning under explicit demand substitution, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
Cites Work
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Lifting for conic mixed-integer programming
- Polymatroids and mean-risk minimization in discrete optimization
- Parallel machine match-up scheduling with manufacturing cost considerations
- Applications of second-order cone programming
- Second-order cone programming
- Retail supply chain management. Quantitative models and empirical studies. With a foreword by Hau L. Lee
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- Assortment Optimization Under Variants of the Nested Logit Model
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
- Aircraft Rescheduling with Cruise Speed Control
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- The d-Level Nested Logit Model: Assortment and Price Optimization Problems
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
- Cuts for Conic Mixed-Integer Programming
