Unsatisfiable Cores and Lower Bounding for Constraint Programming.
Nicholas DowningThibaut FeydyPeter J. StuckeyPublished in: CoRR (2015)
Keyphrases
- lower bounding
- constraint programming
- unsatisfiable cores
- max sat
- branch and bound algorithm
- lower bound
- propositional satisfiability
- dynamic time warping
- multi step
- combinatorial problems
- lower and upper bounds
- constraint satisfaction
- constraint propagation
- branch and bound
- constraint satisfaction problems
- upper bound
- mathematical programming
- np hard
- similarity search
- integer programming
- graph coloring
- edit distance
- column generation
- optimal solution
- randomly generated
- search strategies
- tabu search
- search tree
- combinatorial optimization
- global constraints
- symmetry breaking
- arc consistency
- constraint solvers
- constraint solving
- sat solvers
- stochastic local search
- special case
- evolutionary algorithm
- constraint solver
- search algorithm