In-out algorithm for assortment planning under a ranking-based consumer choice model

DOI10.1016/j.orl.2020.03.005OpenAlexW3014292573MaRDI QIDQ2183213

Sreelata Jonnalagedda, Xiajun Amy Pan, Dorothée Honhon

Publication date: 26 May 2020

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

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

zbMATH Keywords

algorithmretailingassortment planningranking-based choice model

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Related Items (1)

Robust consumer preference analysis with a social network

Cites Work

• Assortment Planning and Inventory Decisions Under a Locational Choice Model
• Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• Building Efficient Product Portfolios at John Deere and Company
• The d-Level Nested Logit Model: Assortment and Price Optimization Problems
• Stocking Retail Assortments Under Dynamic Consumer Substitution
• Inventory Competition Under Dynamic Consumer Choice
• New product introduction against a predator: A bilevel mixed-integer programming approach
• Management of Multi-Item Retail Inventory Systems with Demand Substitution
• Revenue Management Under the Markov Chain Choice Model
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• The Approximability of Assortment Optimization Under Ranking Preferences
• Technical Note—An Expectation-Maximization Method to Estimate a Rank-Based Choice Model of Demand
• A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study

This page was built for publication: In-out algorithm for assortment planning under a ranking-based consumer choice model