A comparative study of decomposition algorithms for stochastic combinatorial optimization.
Lewis NtaimoSuvrajeet SenPublished in: Comput. Optim. Appl. (2008)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- optimization problems
- traveling salesman problem
- simulated annealing
- combinatorial problems
- graph theory
- metaheuristic
- branch and bound
- branch and bound algorithm
- exact algorithms
- quadratic assignment problem
- mathematical programming
- objective function
- computational complexity
- learning algorithm
- vehicle routing problem
- graph cuts
- evolutionary algorithm
- hard combinatorial optimization problems