> you wanted to know a function f that might be harded for your algorithm vs ILP, > and I give you one, as above. I won't tell you it comes from a graph. > (and I implement it to be very slow on small-size subsets :-))
And I maintain it, but you are not allowed to write a problem-specific LP: you should use the LP that works on all instances. If you use the LP that you proposed above on a graph with no edges you are precisely in the situation where the function is equal to lambda x:len(x)<=1. And you will spend an exponential time and memory to find that the largest clique is equal to one vertex. I have not tried, but I am pretty convinced that the function has better performances. nathann -- 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 http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
