A branch-and-cut algorithm for the latent class logit assortment problem
DOI10.1016/J.ENDM.2010.05.049zbMATH Open1237.90259OpenAlexW2123821916MaRDI QIDQ2883584FDOQ2883584
Authors: Isabel Méndez-Díaz, Juan José Miranda-Bront, Paula Zabala, Gustavo Vulcano 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.049
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
- Assortment optimization under the paired combinatorial logit model
- An exact method for assortment optimization under the nested logit model
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queues and service in operations research (90B22) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
Cited In (8)
- Mallows-smoothed distribution over rankings approach for modeling choice
- Exact and asymptotically exact solutions for a class of assortment problems
- Capacity constraints across nests in assortment optimization under the nested logit model
- Assortment optimization under variants of the nested logit model
- Product line optimization with multiples sites
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Assortment optimization over time
- An approximation algorithm for network revenue management under nonstationary arrivals
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 Q2883584)
