Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.
Jesús A. De LoeraJon LeePeter N. MalkinSusan MarguliesPublished in: J. Symb. Comput. (2011)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- combinatorial optimization
- constraint satisfaction problems
- graph coloring
- traveling salesman problem
- constraint satisfaction
- phase transition
- branch and bound algorithm
- global constraints
- hard combinatorial optimization problems
- graph colouring
- solving hard
- combinatorial search
- search strategies
- branch and bound
- upper bound
- tabu search
- access control
- particle swarm optimization
- optimization problems