A dynamic programming approach to solving the assortment planning problem with multiple quality levels

DOI10.1016/j.cor.2011.08.023zbMath1251.90230OpenAlexW1979361300MaRDI QIDQ1762140

Mark H. McElreath, Maria E. Mayorga

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.023

zbMATH Keywords

dynamic programmingline searchassortment planninglocational choice

Mathematics Subject Classification ID

Production theory, theory of the firm (91B38) Dynamic programming (90C39) Marketing, advertising (90B60)

Related Items (1)

Assortment and inventory decisions with multiple quality levels

Cites Work

• Metaheuristics for assortment problems with multiple quality levels
• Assortment Planning and Inventory Decisions Under a Locational Choice Model
• Unnamed Item
• Unnamed Item

This page was built for publication: A dynamic programming approach to solving the assortment planning problem with multiple quality levels