Aleksey.Smirnov at p32.f107.n5015.z2.fidonet.org
Sat Jan 29 07:47:45 EST 2000
What is it known about efficiency of genetic algorithms in the following
problems: finding the least dominating set in a graph and finding the largest
clique? Is there some advance in comparision with classical algorithms of
integer linear programming?
Does anyone know URLs (www) where some GALib examples of solving combinatorial
optimization problems may be obtained?
More information about the galib