Completable Partial Solutions in Constraint Programming and Constraint-Based Scheduling.
András KovácsJózsef VánczaPublished in: CP (2004)
Keyphrases
- constraint programming
- partial solutions
- constraint satisfaction
- constraint satisfaction problems
- combinatorial problems
- search space
- constraint propagation
- scheduling problem
- branch and bound
- constraint optimization
- integer programming
- np hard problems
- constraint logic programming
- search strategies
- symmetry breaking
- heuristic search
- arc consistency
- column generation
- constraint solver
- hard constraints
- hard and soft constraints
- search heuristics
- constraint solving
- itemset mining
- global constraints
- phase transition
- finite domain
- search algorithm
- np complete
- lower bound
- cost function
- special case
- constraint solvers