Tight Bounds for Bandit Combinatorial Optimization.
Alon CohenTamir HazanTomer KorenPublished in: CoRR (2017)
Keyphrases
- combinatorial optimization
- tight bounds
- upper bound
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- simulated annealing
- branch and bound algorithm
- branch and bound
- random sampling
- combinatorial problems
- mathematical programming
- optimization problems
- quadratic assignment problem
- vehicle routing problem
- memetic algorithm
- hard combinatorial optimization problems
- lower bound
- bandit problems
- neural network
- tabu search
- graph theory
- exact algorithms
- search algorithm
- regret bounds
- computer vision