A greedy algorithm for the two-level nested logit model

DOI10.1016/j.orl.2014.05.006zbMath1408.90258MaRDI QIDQ1785243

Guang Li, Paat Rusmevichientong

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.05.006

zbMATH Keywords

greedy algorithm; optimality condition; assortment optimization; revenue management; customer choice; nested logit model

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90B05: Inventory, storage, reservoirs

91B42: Consumer behavior, demand theory

Related Items

Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model, Pricing Competition Under Specific Discrete Choice Models, Technical Note—Assortment Optimization with Small Consideration Sets, Assortment optimization with position effects under the nested logit model, A tractable discrete fractional programming: application to constrained assortment optimization, A review of choice-based revenue management: theory and methods, Capacitated assortment and price optimization under the nested logit model, An exact method for assortment optimization under the nested logit model, Assortment planning for multiple chain stores, On the assortment optimization with endogenized market size, The d-Level Nested Logit Model: Assortment and Price Optimization Problems, Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model

Cites Work

• Unnamed Item
• A PTAS for capacitated sum-of-ratios optimization
• Assortment Optimization Under Variants of the Nested Logit Model
• Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
• Assortment Planning and Inventory Decisions Under a Locational Choice Model
• Discrete Choice Methods with Simulation
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior