You are viewing a single comment's thread from:
RE: Finding subgraphs with constraint programming and Google OR-tools
It feels like we should only need 18 boolean variables to represent this problem; maybe it's using a bunch of auxiliary variables for the edge and ordering constraints?