These basic models are: optimization model, differential equation model, statistical model, probability model, graph theory model and decision model.
The following algorithms run through these models (I will copy and paste them below):
1, Monte Carlo algorithm (this algorithm is also called random simulation algorithm, which solves the problem through computer simulation.
At the same time, you can test the correctness of your model through simulation, which is a necessary method in the competition)
2, data fitting, parameter estimation, interpolation and other data processing algorithms (usually meet a large number of data needs in the competition.
Processing, and the key to processing data lies in these algorithms, usually using Matlab as a tool)
3, linear programming, integer programming, multivariate programming, quadratic programming and other planning problems (most of the problems in modeling competition
Belong to the optimization problem, many times these problems can be described by mathematical programming algorithm, usually with Lindo,
Argot software implementation)
4, graph theory algorithm (this kind of algorithm can be divided into many kinds, including the shortest path, network flow, bipartite graph and other algorithms, involving
Problems related to graph theory can be solved by these methods and need careful preparation)
5, dynamic programming, backtracking search, divide and conquer algorithm, branch and bound computer algorithm (these algorithms are algorithm design.
More commonly used methods can be used in many occasions in the competition)
6. Three non-classical algorithms of optimization theory: simulated annealing method, neural network and genetic algorithm (these problems are
The algorithm used to solve some difficult optimization problems is very helpful to some problems, but the algorithm is true.
It is more difficult now, so it needs to be used with caution)
7, grid algorithm and exhaustive method (grid algorithm and exhaustive method are the best algorithms for violent search, in many competitions.
There are applications in the topic. When we focus on the model itself and despise the algorithm, we can use this violent scheme, preferably.
Use some high-level languages as programming tools)
8, some continuous discretization methods (many problems are practical, data can be continuous, only computers have.
We identify discrete data, so after discretization, we do difference instead of differentiation, and sum instead of integration.
Usually important)
9, numerical analysis algorithm (if you use high-level language programming in the game, that some numerical analysis often.
The algorithms used, such as solving equations, matrix operations, function integration, etc., need to be adjusted by writing extra library functions.
Use)
10, image processing algorithm (there is a kind of problem related to graphics in the competition, even if it has nothing to do with graphics, the paper should be
There is no shortage of pictures, how to display and process these graphics is a problem to be solved, usually using Matlab.
For processing)
I will take part in mathematical modeling in September this year. I hope to communicate with you and make progress together!