Edmonds polytopes and a hierarchy of combinatorial problems.
Vasek ChvátalPublished in: Discret. Math. (2006)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- combinatorial optimization
- graph coloring
- metaheuristic
- constraint satisfaction
- traveling salesman problem
- phase transition
- branch and bound algorithm
- hard combinatorial optimization problems
- combinatorial search
- solving hard
- global constraints
- simulated annealing
- graph colouring
- benchmark problems
- convex hull
- symmetry breaking
- tabu search
- worst case
- constraint solvers
- np hard
- lower bound