Tight Bounds for Bandit Combinatorial Optimization.
Alon CohenTamir HazanTomer KorenPublished in: COLT (2017)
Keyphrases
- combinatorial optimization
- tight bounds
- upper bound
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- branch and bound
- simulated annealing
- random sampling
- branch and bound algorithm
- optimization problems
- mathematical programming
- combinatorial problems
- quadratic assignment problem
- bandit problems
- hard combinatorial optimization problems
- vehicle routing problem
- graph theory
- memetic algorithm
- max flow min cut
- convex optimization
- tabu search
- job shop scheduling problem
- single machine scheduling problem
- cost function
- pairwise
- submodular functions
- multiscale
- genetic algorithm
- neural network