A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem

DOI10.1016/j.endm.2010.05.049zbMath1237.90259OpenAlexW2123821916MaRDI QIDQ2883584

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

zbMATH Keywords

integer programminghyperbolic programmingmultinomial logitchoice behavior

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queues and service in operations research (90B22) Combinatorial optimization (90C27)

Related Items (5)

Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice ⋮ Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model ⋮ An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals ⋮ Assortment optimization over time ⋮ Assortment Optimization Under Variants of the Nested Logit Model

Cites Work

• A note on a global approach for general 0-1 fractional programming
• A Column Generation Algorithm for Choice-Based Network Revenue Management
• Unnamed Item

This page was built for publication: A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem