Do you have a machine with more memory available?
Yes, and while it was better it wasn't quite enough. I think I will have to implement my own algorithm from scratch for this if I want to have a shot at exploring the bigger instances properly.
I'm thinking of a tree-based algorithm similar to what can be found for example in this technical report, but taking into account that I'm not interested in permutations of the same partition as well as simultaneously looking at \( D \) and \( A \).
This of course has nothing to do with polymake anymore.. But I think I will try this.