0 оценок0% нашли этот документ полезным (0 голосов)
6 просмотров1 страница
State space search methods generate all children of the current best solution node before exploring other potential solution nodes. Branch-and-bound refers specifically to state space search methods that generate all children of the current best solution, or E-node, before exploring any other available nodes.
State space search methods generate all children of the current best solution node before exploring other potential solution nodes. Branch-and-bound refers specifically to state space search methods that generate all children of the current best solution, or E-node, before exploring any other available nodes.
State space search methods generate all children of the current best solution node before exploring other potential solution nodes. Branch-and-bound refers specifically to state space search methods that generate all children of the current best solution, or E-node, before exploring any other available nodes.
The Term Branch-And-Bound Refers To All State Space Search Methods in Which All Children of The E-Node Are Generated Before Any Other Live Node Can Become The E-Node