Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems.
Louise LeenenAditya GhosePublished in: PRICAI (2008)
Keyphrases
- constraint satisfaction problems
- branch and bound algorithm
- backtrack search
- combinatorial problems
- finding optimal solutions
- constraint satisfaction
- np hard
- max sat
- soft constraints
- constraint problems
- constraint programming
- lower bound
- branch and bound
- constraint propagation
- graph coloring problems
- solving hard
- search space
- np complete
- boolean satisfiability
- randomly generated
- finding an optimal solution
- non binary
- sat problem
- search tree
- arc consistency
- upper bound
- optimal solution
- graph coloring
- search problems
- constraint solver
- variable ordering
- haplotype inference
- sat solvers
- phase transition
- mathematical programming
- combinatorial optimization
- column generation
- metaheuristic
- scheduling problem
- computational complexity