Manipulating MDD Relaxations for Combinatorial Optimization.
David BergmanWillem Jan van HoeveJohn N. HookerPublished in: CPAIOR (2011)
Keyphrases
- combinatorial optimization
- submodular functions
- simulated annealing
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- branch and bound
- lower bound
- branch and bound algorithm
- optimization problems
- mathematical programming
- combinatorial problems
- semidefinite
- np hard
- hard combinatorial optimization problems
- linear programming
- graph theory
- exact algorithms
- quadratic assignment problem
- memetic algorithm
- single machine scheduling problem
- upper bound
- dynamic programming
- estimation of distribution algorithms
- genetic algorithm