On Fri, Aug 14, 2009 at 8:54 AM, Nathann Cohen<[email protected]> wrote: > > Hello everybody !!! > > Now that the basics of Linear Programming are written, I am looking > for ways to make it useful in Sage : I have been looking for > Optimization/Graph algorithms which could be implemented this way and > came up with the following ones : > > Bin packing > http://en.wikipedia.org/wiki/Bin_packing_problem > > Independent set of Representatives > ( generalizes, for example, graph coloring ) > > Knapsack ( it seems Sage only solves some special cases for the > moment ) > http://en.wikipedia.org/wiki/Knapsack_problem > > Gomory-Hu Tree ( Polynomial ) > http://www.cs.bgu.ac.il/~visproj/eransagi/flow.html > > I will begin to write them as soon as LP will be merged into Sage, but > I thought you may want plenty of other ones, and I sent this message > just for that : if you can think about any Polynomial/NP-complete > function you think would be useful in Sage, say its name ! ;-)
Cool. This really increases my desire to have the LP code merged into Sage! When you write some of the above, it would be good to add a 1-page section to the standard "Sage tutorial" illustrating some of it, so many first time Sage users will encounter this capability of Sage. William > > Nathann > > > > -- William Stein Associate Professor of Mathematics University of Washington http://wstein.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 URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
