On 2013-12-16, Georgi Guninski <[email protected]> wrote: > I am trying to solve a linear integer program with > only 3 integer variables, but numbers are large, > 2^64. > > Couldn't do it with the sage backends, though > PPL might support it (get an error set a var int.). > > Is there such a free solver (probably not in sage)? > > Is there another option? > > gp.lindep() doesn't give optimal solutions. offhand, one can solve ILP via Groebner bases (there was an algorithm by Conti and Traverso). That is, you can code this in Sage, presumably...
Just in case, Dima -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/groups/opt_out.
