An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization.
Luc MercierPascal Van HentenryckPublished in: Ann. Oper. Res. (2011)
Keyphrases
- combinatorial optimization
- simulated annealing
- learning algorithm
- dynamic programming
- quadratic assignment problem
- traveling salesman problem
- k means
- np hard
- metaheuristic
- online learning
- objective function
- monte carlo
- optimization problems
- energy function
- worst case
- search space
- exact algorithms
- max flow min cut
- particle swarm optimization
- hard combinatorial optimization problems
- mumford shah functional
- path relinking
- optimal solution
- combinatorial optimization problems
- mathematical programming
- solution quality
- benchmark problems
- branch and bound algorithm
- constraint programming
- cost function