[Coin-discuss] Finding all solutions to IP

[bremner at unb.ca]

>>>>> "Martin" == Martin von Gagern <Martin.vGagern at gmx.net> writes:

    Martin> Hello!  Trying to avoid reinventing the wheel, I want to
    Martin> know if there is some efficient way to enumerate all
    Martin> MIP-feasible solutions of an IP, i.e. all lattice points
    Martin> inside a finite simplex, building on COIN-OR components.

It is not really an answer to your question, but did you try LattE, 
by de Loera et al?  


http://www.math.ucdavis.edu/~latte/


It is specialized to find all interior lattice
points, and I understand it is quite fast in the case you have not too
many variables.

David