Regret in Online Combinatorial Optimization.
Jean-Yves AudibertSébastien BubeckGábor LugosiPublished in: Math. Oper. Res. (2014)
Keyphrases
- combinatorial optimization
- online learning
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- online algorithms
- branch and bound
- simulated annealing
- combinatorial problems
- mathematical programming
- branch and bound algorithm
- online convex optimization
- lower bound
- optimization problems
- quadratic assignment problem
- single machine scheduling problem
- hard combinatorial optimization problems
- vehicle routing problem
- graph theory
- worst case
- special case
- combinatorial search
- loss function
- max flow min cut
- e learning
- linear programming
- evolutionary algorithm
- path relinking
- exact algorithms
- submodular functions
- tabu search