Hi all,
I have to write a code in C++, where i will use the Iterated Greedy ( IG ) metaheuristic to solve the well know Set Covering Problem..
Any idea?? Cause i don't know how to start..And it's really important
Thanks!!
Hi all,
I have to write a code in C++, where i will use the Iterated Greedy ( IG ) metaheuristic to solve the well know Set Covering Problem..
Any idea?? Cause i don't know how to start..And it's really important
Thanks!!
When you mentioned iterated, I thought of iterators, which is a sorting algorithm used with vectors. but thats proberly wrong. If you are having trouble, give it a bash first then post any errors / code you have done on here.
Double Helix STL
> Any idea?? Cause i don't know how to start..And it's really important
Not as important as you paying attention in class. Had you done the latter, the former would have become unimportant.
There's the web out there. Look for it on google. Good luck. Just don't hit this page.
Originally Posted by brewbuck:
Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.