Technical Note - Capacitated Assortment Optimization: Hardness and Approximation.
Antoine DésirVineet GoyalJiawei ZhangPublished in: Oper. Res. (2022)
Keyphrases
- np hard
- optimization algorithm
- approximation algorithms
- optimization problems
- optimization process
- efficient computation
- global optimization
- computational complexity
- np hardness
- network design problem
- constrained optimization
- learning theory
- combinatorial optimization
- optimization method
- closed form
- error bounds
- branch and bound
- np complete
- worst case
- search algorithm