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? Robust? Is the documentation useful / readable? What benefit would there be to including it in Sage -- couldn't a marginally interested user just install this locally? 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? On Fri, Sep 24, 2010 at 4:09 PM, Michele Comignano <[email protected]> wrote: > Hi to all, > on September, the 15th Google made public the source code of its operations > research internal tools. That consist essetially of a costraint programming > solver and some graph-related algorithms. The cp solver has also a nice > Python interface making it perfect for Sage integration. > Sage is lacking a cp solver and that could be a viable possibility to have > one in it. > > License is Apache 2.0 and here is the project home: > https://code.google.com/p/or-tools/. > > What do you think about? > > -- > 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 > -- 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
