Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms.
Omar El HousniAlfredo TorricoUlysse HennebellePublished in: CoRR (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- quadratic program
- vertex cover
- minimum cost
- approximation ratio
- network design problem
- set cover
- primal dual
- exact algorithms
- facility location problem
- open shop
- optimization problems
- disjoint paths
- approximation schemes
- precedence constraints
- randomized algorithms
- strongly np hard
- genetic algorithm
- combinatorial auctions
- lower bound
- learning algorithm