Avtomatika i TelemekhanikaIssue 12The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application
views: 1675
Readers community rating: votes 0
1. Lazarev A.A. Otsenki absolyutnoj pogreshnosti i skhema priblizhennogo resheniya zadach teorii raspisanij // Zhurn. vychislit. matem. i mat. fiziki. 2009. T. 49. № 2. C. 14–34.
2. Lazarev A.A., Musatova E.G., Gafarov E.R., Kvaratskheliya A.G. Teoriya raspisanij. Zadachi zheleznodorozhnogo planirovaniya. M.: IPU RAN, 2012.
3. Lazarev A.A., Musatova E.G. Tselochislennye postanovki zadachi formirovaniya zheleznodorozhnykh sostavov i raspisaniya ikh dvizheniya // Upravlenie bol'shimi sistemami. 2012. № 38. S. 161–169.
4. Gainanov D.N., Rasskazova V.A. An Inference Algorithm for Monotone Boolean Functions Associated with Undirected Graphs // Bulletin of the SUSU. 2016. No. 9 (3). P. 17–30.
5. Kuznetsov N.A., Paschenko F.F., Ryabykh N.G., Zakharova E.M., Minashina I.K. Algoritmy optimizatsii v zadachakh planirovaniya na rel'sovom transporte // Informatsionnye protsessy. 2014. № 4 (14). S. 307–318.
6. Takmaz'yan A.K., Sheludyakov A.V. Mul'tiagentnoe reshenie metodom auktsionov mnogoproduktovoj transportnoj zadachi s ob'edinennymi potrebnostyami // ISUZhT. 2015. № 1. C. 110–112.
7. Piu F., Speranza M.G. The Locomotive Assignment Problem: A Survey on Optimization Models // Intl. Trans. in Op. Res. 2014. No. 21. P. 327–352.
8. Azanov V.M., Buyanov M.V., Gajnanov D.N., Ivanov S.V. Algoritmicheskoe i programmnoe obespechenie dlya naznacheniya lokomotivov s tsel'yu perevozki gruzovykh sostavov // Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie. 2016. № 9. S. 73–85.
9. Ivanov S.V, Kibzun A.I., Osokin A.V. Stochastic Optimization Model of Locomotive Assignment to Freight Trains // Autom. Remote Control. 2016. V. 77. No. 11. P. 1944–1956.
10. Matyukhin V.G., Kuznetsov N.A., Shabunin A.B., Zhilyakova L.Yu., Takmaz'yan A.K. Grafovaya dinamicheskaya model' zadachi podbora tyagovykh resursov dlya gruzovykh zheleznodorozhnykh perevozok // ISUZhT–2017. M.: AO “NIIAS”, 2017. S. 14–18.
11. Gainanov D.N., Konygin A.V., Rasskazova V.A. Modelling Railway Freight Traffic Using the Methods of Graph Theory and Combinatorial Optimization // Autom. Remote Control. 2016. V. 77. No. 11. P. 1928–1943.
12. Matyukhin V.G., Shabunin A.B., Kuznetsov N.A., Takmazian A.K. Rail Transport Control by Combinatorial Optimization Approach // 11th Int. Conf. on Application of Information and Communication Technologies. 2017. No. 1. P. 419–422.
13. Gajnanov D.N., Kibzun A.I., Rasskazova V.A. Algoritm pokrytiya vershin ori- entirovannogo grafa mnozhestvom orientirovannykh putej v zadache optimal'- nogo naznacheniya i peremescheniya lokomotivov // Vestn. komp'yut. i informats. tekhnologij. 2017. № 5. S. 51–56.
14. Tyshkevich R.I., Suzdal' S.V., Maksimovich O.V., Petrovich R.A. Algebraiche- skaya teoriya dekompozitsii grafov // Vestn. BGU. 2011. No. 1 (3). S. 126–138.
15. Dasgupta S., Papadimitriu Kh., Vazirani U. Algoritmy. M.: MTsNMO, 2014.
16. Korte B., Figen J. Kombinatornaya optimizatsiya. Teoriya i algoritmy. M.: MTsNMO, 2015.
17. Gardiner E., Willett P., Artymiuk P. Graph-Theoretic Techniques for Macromolecular Docking // J. Chem. Inf. Comput. 2000. No. 40. P. 273–279.
18. Bykova V.V. O razlozhenii gipergrafa klikovymi minimal'nymi separatorami // Zhurn. Sib. federal'nogo un-ta. 2012. № 1 (5). S. 36–45.
19. Kharari F. Teoriya grafov. M.: Mir, 1973.
20. Kristofides N. Teoriya grafov. Algoritmicheskij podkhod. M.: Mir, 1978.
