The authors consider the question of professional competences formation in students of economic profile while solving practical problems, namely of the Chinese postman. They did give short historical note about it. The tasks were solved using Fleury’s algorithm to find an Euler graph for optimal route of delivery of flower arrangements, which will have a minimal cost. The authors have stated that educational process contributes to the preparation of commercially successful specialists both for Russian and global labor markets.

Keywords: competence formation; Fleury’s algorithm; Chinese postman problem; Euler graph; Euler cycle; NP-completeness.

References

1. Strukova S. V., Korovina Z. V. Osobennosti konstruirovaniya sub”ekt-orientirovannogo soderzhaniya uchebno-poznavatel’noi deyatel’nosti studenta ekonomicheskogo profilya v usloviyakh universiteta (Peculiarities of Building Subject-Oriented Content of Economics Student’s Learning and Cognitive Activity in University Environment), Sovremennoe obrazovanie: soderzhanie, tekhnologii, kachestvo, mat-ly XX Mezhdunar. nauch.-metod.
   konf. (23 aprelya 2014 g.), SPb., Izd-vo SPbGETU “LETI”, 2014, T. 2, pp. 156—157.
2. Revyakin A. M., Bardushkina I. V. Matematicheskie metody modelirovaniya v ekonomike (Mathematical Methods of Model Building in Economics), M., MIET, 2013, 328 p.
3. Edmonds J., Johnson E. L. (1973) Matching, Euler tours and the Chinese postman, Mathematical Programming, 5: 88—124.
4. Kristofides N. Teoriya grafov. Algoritmicheskii podkhod (Theory of Graphs. Algorithmic Approach), M., Mir, 1978, 432 p., il.
5. Burdonov I. B., Kosachev A. S., Kulyamin V. V. Neizbytochnye algoritmy obkhoda orientirovannykh grafov. Nedeterminirovannyi sluchai (Irredundant Algorithms of Girth of Orgraphs), Programmirovanie, 2004, No. 1, pp. 4—24.
6. Thimbleby H. (2003), The directed Chinese Postman Problem. Softw: Pract. Exper., 33: 1081–1096. DOI:10.1002/spe.540.