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 ...

I re-ran my code with your second example and it terminated after 3-4 hours. It found 287301 lattice points. Is this the same number that you get?


Yes.


You might try the other algorithms that are implemented in polymake, but I would not expect too much. If you have runtimes of 15 seconds for ...

Thank you for the information. I ran my code on both examples.

For the first example, I think you provided the wrong solution. The example is three-dimensional and your solution is 15-dimensional. I think the correct solution is (0,13,2)^T . This is found instantaneously (for obvious reasons).

I ...

I wish to enumerate all lattice points contained in the intersection of three hyperplanes in the non-negative half-space. That is to say, I have three linear equations of d variables and I would like to find all non-negative integer solutions.
I would be happy if you could share your equations ...

I'm wondering whether polymake can help me with the following problem.

I wish to enumerate all lattice points contained in the intersection of three hyperplanes in the non-negative half-space. That is to say, I have three linear equations of d variables and I would like to find all non-negative ...