Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems.
Troy LeeDirk Oliver TheisPublished in: CTW (2012)
Keyphrases
- combinatorial optimization problems
- semidefinite
- lower bound
- knapsack problem
- combinatorial optimization
- metaheuristic
- optimization problems
- semidefinite programming
- upper bound
- optimal solution
- branch and bound
- branch and bound algorithm
- ant colony optimization
- objective function
- np hard
- optimization methods
- convex relaxation
- traveling salesman problem
- sufficient conditions
- higher dimensional
- convex sets
- worst case
- interior point methods
- linear programming
- valid inequalities
- min cost
- genetic algorithm
- vehicle routing problem
- simulated annealing
- finite dimensional
- search space
- tabu search