Lower bounds for sizes of semidefinite formulations for some combinatorial optimization problems
Troy LeeDirk Oliver TheisPublished in: CoRR (2012)
Keyphrases
- combinatorial optimization problems
- semidefinite
- lower bound
- optimization problems
- knapsack problem
- combinatorial optimization
- semidefinite programming
- upper bound
- metaheuristic
- branch and bound algorithm
- optimization methods
- objective function
- convex relaxation
- branch and bound
- optimal solution
- ant colony optimization
- np hard
- interior point methods
- higher dimensional
- traveling salesman problem
- sufficient conditions
- worst case
- min cost
- convex optimization
- finite dimensional