Solving chance-constrained combinatorial problems to optimality.
Olivier KlopfensteinPublished in: Comput. Optim. Appl. (2010)
Keyphrases
- combinatorial problems
- chance constrained
- combinatorial optimization
- solving hard
- graph coloring
- constraint programming
- stochastic programming
- metaheuristic
- traveling salesman problem
- constraint satisfaction problems
- constraint satisfaction
- branch and bound algorithm
- robust optimization
- optimal solution
- sat encodings
- optimization problems
- phase transition
- chance constraints
- chance constrained programming
- simulated annealing
- knapsack problem
- finite domain
- computationally tractable
- global constraints
- branch and bound
- vehicle routing problem
- multistage
- ant colony optimization
- reverse logistics
- mathematical programming
- linear program
- search problems
- worst case
- supply chain
- dynamic programming
- lower bound
- genetic algorithm
- neural network