A branch-and-cut algorithm for the latent-class logit assortment problem
From MaRDI portal
Publication:496669
DOI10.1016/j.dam.2012.03.003zbMath1326.90041OpenAlexW2174936192MaRDI QIDQ496669
Paula Zabala, Juan José Miranda-Bront, Isabel Méndez-Díaz, Gustavo J. Vulcano
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.003
integer programmingfractional programmingrevenue managementmultinomial logitchoice behaviorretail operations
Mixed integer programming (90C11) Fractional programming (90C32) Management decision making, including multiple objectives (90B50)
Related Items (29)
Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection ⋮ Exact approaches for competitive facility location with discrete attractiveness ⋮ Assortment optimization under the sequential multinomial logit model ⋮ Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets ⋮ Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds ⋮ Fractional 0-1 programming and submodularity ⋮ Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables ⋮ Technical Note—Capacitated Assortment Optimization: Hardness and Approximation ⋮ On the linear integration of attraction choice models in business optimization problems ⋮ Fractional 0-1 programming: applications and algorithms ⋮ An efficient method for joint product line selection and pricing with fixed costs ⋮ Constrained multi‐location assortment optimization under the multinomial logit model ⋮ Data‐driven research in retail operations—A review ⋮ Combinatorial assortment optimization ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming ⋮ Callable products with dependent demands ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Pricing Competition Under Specific Discrete Choice Models ⋮ Technical Note—Assortment Optimization with Small Consideration Sets ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ The Approximability of Assortment Optimization Under Ranking Preferences ⋮ Discovering heterogeneous consumer groups from sales transaction data ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ A review of choice-based revenue management: theory and methods ⋮ On a Piecewise-Linear Approximation for Network Revenue Management ⋮ Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments ⋮ Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model ⋮ Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences ⋮ Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings
Cites Work
- Unnamed Item
- A note on a global approach for general 0-1 fractional programming
- The theory and practice of revenue management
- Retail supply chain management. Quantitative models and empirical studies. With a foreword by Hau L. Lee
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- Stocking Retail Assortments Under Dynamic Consumer Substitution
- Combinatorial Optimization with Rational Objective Functions
- Discrete Choice Methods with Simulation
- Management of Multi-Item Retail Inventory Systems with Demand Substitution
- On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
This page was built for publication: A branch-and-cut algorithm for the latent-class logit assortment problem
