Inapproximability of Combinatorial Problems via Small LPs and SDPs.
Gábor BraunSebastian PokuttaDaniel ZinkPublished in: STOC (2015)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- graph coloring
- traveling salesman problem
- combinatorial optimization
- metaheuristic
- constraint satisfaction
- phase transition
- solving hard
- combinatorial search
- hard combinatorial optimization problems
- global constraints
- branch and bound algorithm
- optimal solution
- approximation algorithms
- optimization problems
- simulated annealing
- neural network