Edmonds polytopes and a hierarchy of combinatorial problems.
Vasek ChvátalPublished in: Discret. Math. (1973)
Keyphrases
- combinatorial problems
- constraint programming
- graph coloring
- combinatorial optimization
- constraint satisfaction problems
- metaheuristic
- traveling salesman problem
- constraint satisfaction
- solving hard
- phase transition
- branch and bound algorithm
- lattice points
- graph colouring
- global constraints
- convex hull
- hard combinatorial optimization problems
- constraint propagation
- specific problems
- constraint solving
- combinatorial search
- search space
- optimal solution
- cellular automata
- tabu search
- finite domain
- lower bound