Say the edges of a 4 nodes graph are
1 2 and
The solution to the colouring problem can be
0,1,0,0, both are essentially the same. How I can model redundant constraints for this?
Operations Research Stack Exchange is a question and answer site for operations research and analytics professionals, educators, and students. It only takes a minute to sign up.Sign up to join this community
Search for symmetry breaking constraints. Here's a small but common example: https://math.stackexchange.com/questions/4415333/assymetric-graph-coloring-formulation
Fix some variables. E.g. Greedily find the largest clique in your graph, and hard code the colors of the vertices in this clique.