BRANCH CHOICE IN A BRANCH-AND-BOUND METHOD
Abstract
The algorithm of branches choicing used for branching of search of decision tree in a branch-and-bound is offered in the article. An estimation allowing to shorten decision search branching amount at the decision of task of traveling salesman tree is offered. The algorithm of task decision is offered. An example of task decision with the use of the offered estimation is given