Il 25/09/2010 03:59, Tom Boothby ha scritto:
I kinda like the look of it, though I'm unfamiliar with constraint
programming. It looks like it solves TSP, so that seems like a good
enough reason for me. However, there are some standard questions
before we add something to Sage:
Is it stable?
No, they released just few days ago, it has been internal code before
September 15th.
Robust?
Can't say without long time testing. But it works.
Is the documentation useful / readable?
Is possible to make better, but the porject has been open sourced little
time ago.
What benefit would there be to including it in Sage -- couldn't a
marginally interested user just install this locally?
Couldn't a marginally interested user just install the required sage component
of sage locally?
The main advantage (can say the mission) of Sage is offering a unified and
clear interface to good
open source mathematics software, all in one. Sage already has a good mip
solver interface. I think having
more or-tools into sage being better than having less. And constaint
programming is a great tool.
And here's the
big one: are you (or do you know somebody) willing to commit to
maintaining the package for the lifetime of its inclusion into Sage?
Why not? Anyway, looking at the code, google or-tools are lacking of
multi platform
compiling facilities (no configure, some arch dependent code and so on).
An external spkg
(as for any new sage software inclusion) shoul be the start point.
--
Michele Comignano
Computer Science student
University of Pisa, Italy
--
To post to this group, send an email to [email protected]
To unsubscribe from this group, send an email to
[email protected]
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
