On Tue, Dec 31, 2013 at 06:08:20AM +0000, Dima Pasechnik wrote:
> On 2013-12-31, Dima Pasechnik <[email protected]> wrote:
> > 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...
>
> another option might be to use LattE
> http://boxen.math.washington.edu/home/sagemath/sage-mirror/spkg/experimental/latte_int-1.6.spkg
> Sage has next to no interface to LattE at the moment, one can better
> run it in Sage shell...
>
>
Happy new year!
Thanks for LattE.
Another arbitrary precision solver I found
is isl. It works for me.
There are sample applications and constraints look like:
$./isl_polyhedron_sample
{ [A,B] : 1 <= A and A <= 808711 and 1 <= B and 1 <= 654013667618 * A -
654013667619 * B <= 808711 }
--
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.
