Hi all, In OpenOpt (BSD-licensed software, http://openopt.org ) we have implemented new class - STAB - searching for maximum stable set of a graph.
networkx <http://networkx.lanl.gov/> graphs are used as input arguments. Unlike networkx maximum_independent_set() we mostly focus on searching for exact solution (this is NP-Hard problem). <http://openopt.org/interalg> interalg <http://openopt.org/interalg> or OpenOpt MILP<http://openopt.org/MILP>solvers are used, some GUI features and stop criterion (e.g. maxTime, maxCPUTime, fEnough) can be used. Optional arguments are includedNodes and excludedNodes - nodes that have to be present/absent in solution. See http://openopt.org/STAB for details. Future plans (probably very long-term although) include TSP and some other graph problems with similar API and possibilities. ------------------------- Regards, Dmitrey. -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
