1, Monte Carlo algorithm (this algorithm is also called stochastic simulation algorithm, which is an algorithm to solve problems through computer simulation, and at the same time, it can test the correctness of its model through simulation, which is an essential method in the competition).

2. Data processing algorithms, such as data fitting, parameter estimation and interpolation.

3, linear programming, integer programming, multivariate programming, quadratic programming and other planning issues.

4. Graph theory algorithm (this kind of algorithm can be divided into many kinds, including shortest path algorithm, network flow algorithm, bipartite graph algorithm, etc. , and problems related to graph theory can be solved by these methods, which need careful preparation).

5. Computer algorithms such as dynamic programming, backtracking, divide-and-conquer algorithm, branch and bound.

6. Three non-classical algorithms of optimization theory: simulated annealing method, neural network and genetic algorithm.

7. Grid algorithm and exhaustive method.

8. Some continuous discretization methods.

9. Numerical analysis algorithm (if high-level language programming is used in the competition, some commonly used algorithms in numerical analysis, such as solving equations, matrix operation, function integration, etc., need to write additional library functions to call).

10, image processing algorithm.

Modeling requirements:

1) is true, systematic and complete, and the image reflects the objective phenomenon.

2) It must be representative.

3) Extrapolation, that is, the information of the prototype object can be obtained, and the reasons about the prototype object can be obtained in the process of model research and experiment.

4) It must reflect the various achievements made in completing the basic tasks and should be consistent with the actual situation.