Tractable Approximations for Assortment Planning with Product Costs

DOI10.1287/opre.2018.1771zbMath1444.90015OpenAlexW2924127585WikidataQ128191134 ScholiaQ128191134MaRDI QIDQ5126613

Sumit Kunnumkal, Victor Martínez-de-Albéniz

Publication date: 20 October 2020

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

Full work available at URL: http://eprints.exchange.isb.edu/736/1/AssortmentCosts_web.pdf

zbMATH Keywords

dualityfixed costsassortment planningmultinomial logitoptimality gapparametric relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05)

Related Items (4)

Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Robust assortment optimization under sequential product unavailability ⋮ Fractional 0-1 programming and submodularity

Cites Work

• Unnamed Item
• Optimal dynamic price selection under attraction choice models
• On upper bounds for assortment optimization under the mixture of multinomial logit models
• Assortment Optimization Under Variants of the Nested Logit Model
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• A Column Generation Algorithm for Choice-Based Network Revenue Management
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
• Maximizing a Class of Utility Functions Over the Vertices of a Polytope
• A refined deterministic linear program for the network revenue management problem with customer choice behavior

This page was built for publication: Tractable Approximations for Assortment Planning with Product Costs