Greedy Local Search

T := an initial tree;

best-cost := c(T);

repeat

cost := best-cost;

for each neighbor T’ of T do

if c(T’) < best-cost then

T := T’;

best-cost := c(T);

until (best-cost = cost)

return(T)

• Find the best neighbor and continue.

Previous slide

Next slide

Back to first slide

View graphic version