On Tue, Apr 16, 2013 at 09:09:19AM +0000, Simon King wrote:
> On 2013-04-16, Nicolas M. Thiery <nicolas.thi...@u-psud.fr> wrote:
> > For non exact covers, this can be formulated straightforwardly as a
> > Mixed Integer Linear Program (MILP): take a 0-1 variable y_S for each
> > set S, and an inequation $\sum_{S, x\in S} y_S \geq 1$. So the problem
> > can be reduced (efficiently???) to that of iterating through the
> > integer points in a polytope. There are very optimized software using
> > backtracking algorithm to find optimal solutions for such systems of
> > equations.
>
> How can this be done in Sage?
sage: MixedIntegerLinearProgram?
:-)
But Nathann will be the one to tell you about the status for the
iteration feature.
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-combinat-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
