Near-tight (2/3-ε) approximation for identical-capacity bottleneck multiple knapsack and (1/2-ε) for arbitrary capacities, with matching inapproximability.
Title resolution pending
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
-
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
Near-tight (2/3-ε) approximation for identical-capacity bottleneck multiple knapsack and (1/2-ε) for arbitrary capacities, with matching inapproximability.
-
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.