Turn from: 78171976
One, the contrast backtracking method
- The goal of backtracking is to find out all the solutions that satisfy the constraint in the solution space, in contrast, the Solution object of branch-bound method is to find out a solution satisfying the constraint condition, or to find the solution that makes the value of a certain objective function reach a maximum or a minimum, that is, the optimal solution in some sense.
- Another very big difference is that backtracking searches the solution space in a depth-first way, while the branch boundary law searches the solution space in a breadth-first way or in the least-expensive way.
The search strategy of branch-bound method
- At the current node (the extension node), the husband becomes all of its sons nodes (branches), and then selects the next extension node from the table of the currently active node (the child node of the current node). In order to effectively select the next expansion node, speed up the process of searching, at each living node, calculate a function value (gauge), and according to the function value, select one of the most advantageous nodes in the current node table as the extension node, so that the search toward the solution space has the best solution branch propulsion, so as to find an optimal solution. The branch-bound method solves a large number of discrete optimization problems.
Branch and gauge method
