Let Q:=r₀(V₁,...,V_a(ro)),H:=Æ.
WHILE Q¹Æ

• select a subset C from Q according to search strategy
• let r(C):={r_opt(h) | hÎC}
• test each h Î r(C) on D (compute d(h, D) using sampling)
• if d(h,D) =0, prune
• else if d_max(h,D) < min_h'ÎH d(h',D), prune.
• else
• if d(h,D) > min_h'ÎH d(h',D)_{, remove the bottommost element of H and add h}
• _{add h to Q.}