The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems.
Joshua BrakensiekVenkatesan GuruswamiMarcin WrochnaStanislav ZivnýPublished in: SIAM J. Comput. (2020)
Keyphrases
- constraint satisfaction problems
- linear programming
- constraint propagation
- constraint satisfaction
- np hard
- constraint programming
- search space
- objective function
- np complete
- lp relaxation
- linear program
- non binary
- constraint solving
- lagrangian relaxation
- global constraints
- combinatorial problems
- computational problems
- constraint networks
- optimal solution
- solving constraint satisfaction problems
- arc consistency
- pseudo boolean optimization
- constraint optimization
- constraint graph
- constraint problems
- constraint solver
- disjunctive temporal
- computational complexity
- finite domain
- decomposition methods
- sat problem
- graph coloring
- special case
- backtracking search
- temporal constraints
- finding optimal solutions
- path consistency
- dynamic constraint satisfaction problems
- column generation