A dynamic programming algorithm solves the column generation subproblem to enable efficient estimation of single- and multi-purchase ranked list choice models.
Revenue management and pricing analytics , pages=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
OPTIMUS uses binary knapsack modeling and dynamic programming to allocate retail space among planograms, achieving 11.8% average sales lift and 9.5% margin lift in multi-department evaluations.
citing papers explorer
-
Modern column generation for estimating single- and multi-purchase ranked list choice models
A dynamic programming algorithm solves the column generation subproblem to enable efficient estimation of single- and multi-purchase ranked list choice models.
-
OPTIMUS: Optimization Productivity Tool for Intelligent Management of Utilizable Space
OPTIMUS uses binary knapsack modeling and dynamic programming to allocate retail space among planograms, achieving 11.8% average sales lift and 9.5% margin lift in multi-department evaluations.