Approximation Algorithms for Dynamic Assortment Optimization Models.

Ali Aouad Retsef Levi Danny Segev

Published in: Math. Oper. Res. (2019)

Keyphrases

approximation algorithms
np hard
worst case
facility location problem
special case
model selection
vertex cover
probabilistic model
lower bound
optimization problems
linear programming
optimization model
network design problem