Graph Neural Networks for Maximum Constraint Satisfaction
Many combinatorial optimization problems can be KYOLIC EXTRA STRENGTH phrased in the language of constraint satisfaction problems.We introduce a graph neural network architecture for solving such optimization problems.The architecture is generic; it works for all binary constraint satisfaction problems.Training is unsupervised, and it is sufficient