[Coin-discuss] Finding all solutions to IP

[bremner at unb.ca]

>>>>> "bremner" == bremner  <bremner at unb.ca> writes:

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

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


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


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


I misspoke.  Latte can count the interior points, but not list them
explicitly as far as I understand things.

David