LP and SDP inapproximability of combinatorial problems.
Gábor BraunSebastian PokuttaDaniel ZinkPublished in: CoRR (2014)
Keyphrases
- combinatorial problems
- linear programming
- semidefinite programming
- constraint programming
- linear program
- semi definite programming
- approximation algorithms
- constraint satisfaction problems
- constraint satisfaction
- metaheuristic
- combinatorial optimization
- constraint propagation
- graph coloring
- traveling salesman problem
- primal dual
- phase transition
- np hard
- branch and bound algorithm
- solving hard
- lp relaxation
- graph colouring
- hard combinatorial optimization problems
- global constraints
- optimal solution
- combinatorial search
- semidefinite
- integer programming
- column generation
- dynamic programming
- search space
- computational complexity
- neural network
- maximum satisfiability
- objective function
- boolean satisfiability
- specific problems
- evolutionary algorithm
- multi objective
- orders of magnitude
- randomly generated