A branch-and-cut algorithm for the latent-class logit assortment problem

DOI10.1016/J.DAM.2012.03.003zbMATH Open1326.90041OpenAlexW2174936192MaRDI QIDQ496669FDOQ496669

Authors: Isabel Méndez-Díaz, Juan José Miranda-Bront, Paula Zabala, Gustavo 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

Recommendations

• A branch-and-cut algorithm for the latent class logit assortment problem
• Assortment optimization under variants of the nested logit model
• A survey of assortment optimization problems under logit-based discrete choice models
• An exact method for assortment optimization under the nested logit model
• Assortment optimization under the paired combinatorial logit model

zbMATH Keywords

integer programmingfractional programmingrevenue managementmultinomial logitchoice behaviorretail operations

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Fractional programming (90C32) Mixed integer programming (90C11)

Cites Work

• Discrete Choice Methods with Simulation
• Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
• A column generation algorithm for choice-based network revenue management
• Combinatorial Optimization with Rational Objective Functions
• A note on a global approach for general 0-1 fractional programming
• The theory and practice of revenue management
• Stocking Retail Assortments Under Dynamic Consumer Substitution
• Management of Multi-Item Retail Inventory Systems with Demand Substitution
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• 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 with demand learning for seasonal consumer goods
• Title not available (Why is that?)

Cited In (38)

• Technical note -- Capacitated assortment optimization: hardness and approximation
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• Technical note -- Assortment planning for two-sided sequential matching markets
• Technical note: Assortment optimization with small consideration sets
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
• Fractional 0-1 programming: applications and algorithms
• Assortment optimization under the sequential multinomial logit model
• Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
• A review of choice-based revenue management: theory and methods
• Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings
• The approximability of assortment optimization under ranking preferences
• Online assortment and market segmentation under Bertrand competition with set-dependent revenues
• An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model
• A survey of assortment optimization problems under logit-based discrete choice models
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
• Assortment optimization and pricing under the multinomial logit model with impatient customers: sequential recommendation and selection
• An efficient method for joint product line selection and pricing with fixed costs
• Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models
• Exact and asymptotically exact solutions for a class of assortment problems
• Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
• A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming
• Approximation methods for pricing problems under the nested logit model with price bounds
• Fractional 0-1 programming and submodularity
• On the linear integration of attraction choice models in business optimization problems
• Callable products with dependent demands
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
• Constrained multi‐location assortment optimization under the multinomial logit model
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
• Exact approaches for competitive facility location with discrete attractiveness
• Product line optimization with multiples sites
• A branch-and-cut algorithm for the latent class logit assortment problem
• Combinatorial assortment optimization
• Assortment optimization: a systematic literature review
• Discovering heterogeneous consumer groups from sales transaction data
• On a piecewise-linear approximation for network revenue management
• Data‐driven research in retail operations—A review
• Pricing competition under specific discrete choice models
• Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences

This page was built for publication: A branch-and-cut algorithm for the latent-class logit assortment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496669)