Five of the five commonly used algorithms: branch and bound method
Abstract: Branch and bound method 1. The basic description is similar to the backtracking method, and it is also an algorithm to search for the solution of the problem on the solution space tree T of the problem. But in general, the branch-and-bound method and the backtracking method have different solution goals. The solution goal of the backtracking method is to find all solutions in T that satisfy the constraints, while the solution goal of the branch-and-bound method is to find a solution that satisfies the constraints, or find a solution that satisfies the constraints. The function value reaches the maximum or minimum solution, that is, the optimal solution in a certain sense. (1) Branch search algorithm The so-called "branch" is to use a breadth-first strategy to search E-... Read more
POSTED @ 2010-05-22 09:22 Redface Scholar Read (26055) | Comments (0) Edit
The third of the five commonly used algorithms: greedy algorithm
Abstract: Greedy algorithm 1. Basic concepts: The so-called greedy algorithm means that when solving a problem, it always makes the best choice at present. That is to say, instead of considering the overall optimality, what he has made is only a local optimal solution in a certain sense. The greedy algorithm has no fixed algorithm framework, and the key to algorithm design is the choice of greedy strategy. It must be noted that the greedy algorithm cannot obtain the overall optimal solution for all problems, and the selected greedy strategy must have no aftereffect, that is, the process after a certain state will not affect the previous state, only related to the current state. So on the greedy adopted... read full article
POSTED @ 2010-05-22 09:21 RED FACEBOOK STUDENT READ (91871) | COMMENT (3) EDIT
Four of the five commonly used algorithms: backtracking
Abstract: 1. The concept backtracking algorithm is actually a search attempt process similar to enumeration. It is mainly to find the solution of the problem during the search attempt process. When it is found that the solution conditions are not satisfied, it "backtracks" and returns to try another path. The backtracking method is an optimal search method, which searches forward according to the optimal conditions to achieve the goal. However, when the exploration reaches a certain step, and it is found that the original choice is not optimal or fails to achieve the goal, it will take a step back and re-selection. called "backtracking points". Many complex, larger-scale problems can be used back... read more
POSTED @ 2010-05-22 09:21 RED FACEBOOK STUDENT READ (35081) | COMMENT (5) EDIT
The second of the five commonly used algorithms: dynamic programming algorithm
Abstract: 1. The basic concept The dynamic programming process is: each decision depends on the current state, and immediately causes the transition of the state. A decision sequence is generated in a changing state, so this multi-stage optimization decision-making process is called dynamic programming. 2. Basic idea and strategy The basic idea is similar to the divide-and-conquer method. It also decomposes the problem to be solved into several sub-problems (stages), and solves the sub-stages in sequence. useful information. When solving any sub-problem, list various possible local solutions, and keep those that are likely to reach... Read more
POSTED @ 2010-05-22 09:20 RED FACEBOOK STUDENT READ (159303) | COMMENT (14) EDIT
One of the five commonly used algorithms: divide and conquer algorithm
Abstract: Divide and conquer algorithm 1. Basic concepts In computer science, divide and conquer method is a very important algorithm. The literal interpretation is "divide and conquer", which is to divide a complex problem into two or more identical or similar sub-problems, and then divide the sub-problems into smaller sub-problems... until the final sub-problem can be simply solved directly , the solution of the original problem is the combination of the solutions of the sub-problems. This technique is the basis of many efficient algorithms, such as sorting algorithms (quick sort, merge sort), Fourier transform (fast Fourier transform) &hellip... read the full text