I agree with Vincent; I probably not the right person for this task, though, and I also not sure I have the time now. I will open a relevant ticket.
On Thursday, 23 February 2017 10:32:20 UTC+2, vdelecroix wrote: > > It is still reasonable to: > > 1) make an experimental package > > 2) test it against the MILP implementation in Sage (both in terms of > performance and validity) > > [optional] 3) ask for/propose an API at C level > > Vincent > > Le 22/02/2017 à 23:14, Dima Pasechnik a écrit : > > it's a bit unfortunate that there is no API provided, only file > > input/output. > > But yes, why not? > > > > They look like reliable people---something that is important; we had bad > > experience with published C code > > (for modular decomposition of graphs) that was interfaced with Sage, > turned > > out to be buggy, and then abandoned by its original > > author... > > > > On Wednesday, February 22, 2017 at 11:32:55 AM UTC, Peleg Michaeli > wrote: > >> > >> Hi, > >> > >> We may wish to consider embedding this: > >> > >> http://algo2.iti.kit.edu/kalp/ > >> > >> into sage, or copying its algorithm. > >> > >> > >> Peleg. > >> > > > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
