Matroids are widely applied in discrete mathematics and computer science and can be successfully used
in economic systems modeling. The authors present information from matroid theory and examples of economic and mathematical models in the form of matroids. Descriptions of algorithms used to find a solution for problems (assignment, time-table, travelling salesman ones and other, with or without “matroid” structure)
are given and the information about their accuracy is provided. The algorithms are considered for  independence systems, matroids, and intersection of two matroids.
Keywords: mathematical model; economic system; matroid; greedy algorithm; intersection of matroids.

References

1. Oxley J. G. Matroid Theory. 2nd ed. Oxford; New York, Oxford Univ. Press, 2011, VIII, 684 p., il., Oxford graduate texts in mathematics; 21.
2. Algoritmy: postroenie i analiz = Introduction to Algorithms, T. Kh. Kormen, Ch. I. Leizerson, R. L. Rivest, K. Shtain, M. [i dr.], Vil’yams, 2013, 1323 p., il.
3. Hausmann D., Korte B. Lower Bounds on the Worst-case Complexity of Some Oracle Algorithms, Discrete Mathematics, 1978, Vol. 24, Issue 3, pp. 261—276.
4. Papadimitriu Kh., Staiglits K. Kombinatornaya optimizatsiya. Algoritmy i slozhnost’ = Combinatorial Optimization, Per. s angl. i predisl. V. B. Alekseeva, M., Mir, 1985, 510 p., il.