2-years impact-factor Math-Net.Ru of «Diskretnyi Analiz i Issledovanie Operatsii» journal, 2017

2-years impact-factor Math-Net.Ru of the journal in 2017 is calculated as the number of citations in 2017 to the scientific papers published during 2015–2016.

The table below contains the list of citations in 2017 to the papers published in 2015–2016. We take into account all citing publications we found from different sources, mostly from references lists available on Math-Net.Ru. Both original and translation versions are taken into account.

The impact factor Math-Net.Ru may change when new citations to a year given are found.

1 2  Full list
N	Citing pulication		Cited paper
1.	V. Emelichev, Yu. Nikulin, V. Korotkov, “Stapility analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria”, Comput. Sci. J. Mold., 25:3 (2017), 303–328	→	On stability of solutions of a vector variant of one investment problem S. E. Bukhtoyarov, V. A. Emelichev Diskretn. Anal. Issled. Oper., 22:2 (2015),  5–16
2.	R. Yu. Simanchev, “O neravenstvakh, porozhdayuschikh fasety kombinatornykh mnogogrannikov”, Diskretn. analiz i issled. oper., 24:4 (2017), 95–110	→	On the faces of the graph approximation problem polytope R. Yu. Simanchev, I. V. Urazova Diskretn. Anal. Issled. Oper., 22:2 (2015),  86–101
3.	A. Kel'manov, V. Khandeev, “Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), IEEE, 2017, 91–93	→	A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum E. Kh. Gimadi, I. A. Rykov Diskretn. Anal. Issled. Oper., 22:3 (2015),  5–17
4.	A. V. Eremeev, A. V. Kel'manov, A. V. Pyatkin, “On complexity of searching a subset of vectors with shortest average under a cardinality restriction”, Analysis of Images, Social Networks and Texts, AIST 2016, Communications in Computer and Information Science, 661, ed. D. Ignatov, M. Khachay, V. Labunets, N. Loukachevitch, S. Nikolenko, A. Panchenko, A. Savchenko, K. Vorontsov, Springler, 2017, 51–57	→	A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum E. Kh. Gimadi, I. A. Rykov Diskretn. Anal. Issled. Oper., 22:3 (2015),  5–17
5.	V. A. Emelichev, S. E. Bukhtoyarov, “O radiuse odnogo tipa ustoichivosti mnogokriterialnoi investitsionnoi zadachi minimizatsii riskov”, Tr. In-ta matem., 25:1 (2017), 3–14	→	Comparison of three approaches to studing stability of solutions to discrete optimization and computational geometry problems E. N. Gordeev Diskretn. Anal. Issled. Oper., 22:3 (2015),  18–35
6.	Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Geneticheskii lokalnyi poisk i slozhnost approksimatsii zadachi balansirovki nagruzki na servery”, Avtomat. i telemekh., 2017, № 3, 51–62	→	Comparison of metaheuristics for the bilevel facility location and mill pricing problem Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov Diskretn. Anal. Issled. Oper., 22:3 (2015),  36–54
7.	I. P. Chukhrov, “O dokazatelstve minimalnosti pokrytii cherez obobschenie ponyatiya nezavisimosti”, Diskretn. analiz i issled. oper., 24:2 (2017), 87–106	→	On the problem of minimizing a single set of Boolean functions I. P. Chukhrov Diskretn. Anal. Issled. Oper., 22:3 (2015),  75–97
8.	A. Erzin, “Energy-efficient monitoring of the strip by identical one side directed devices”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), IEEE, 2017, 58–62	→	About density of a covering of a strip with identical sectors A. I. Erzin, N. A. Shabelnikova Diskretn. Anal. Issled. Oper., 22:4 (2015),  21–34
9.	A. V. Kelmanov, S. A. Khamidullin, V. I. Khandeev, “Tochnyi psevdopolinomialnyi algoritm dlya odnoi zadachi razbieniya posledovatelnosti”, Avtomat. i telemekh., 2017, № 1, 80–90	→	An exact pseudopolynomial algorithm for a bi-partitioning problem A. V. Kel'manov, V. I. Khandeev Diskretn. Anal. Issled. Oper., 22:4 (2015),  50–62
10.	A. V. Kelmanov, A. V. Motkova, V. V. Shenmaier, “Priblizhennaya skhema dlya zadachi vzveshennoi 2-klasterizatsii s fiksirovannym tsentrom odnogo klastera”, Tr. IMM UrO RAN, 23, № 3, 2017, 159–170	→	An exact pseudopolynomial algorithm for a bi-partitioning problem A. V. Kel'manov, V. I. Khandeev Diskretn. Anal. Issled. Oper., 22:4 (2015),  50–62
11.	A. Kel'manov, V. Khandeev, “Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), IEEE, 2017, 91–93	→	An exact pseudopolynomial algorithm for a bi-partitioning problem A. V. Kel'manov, V. I. Khandeev Diskretn. Anal. Issled. Oper., 22:4 (2015),  50–62
12.	A. Kel'manov, A. Motkova, “An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), IEEE, 2017, 94–96	→	An exact pseudopolynomial algorithm for a bi-partitioning problem A. V. Kel'manov, V. I. Khandeev Diskretn. Anal. Issled. Oper., 22:4 (2015),  50–62
13.	A. V. Eremeev, A. V. Kel'manov, A. V. Pyatkin, “On complexity of searching a subset of vectors with shortest average under a cardinality restriction”, Analysis of Images, Social Networks and Texts, AIST 2016, Communications in Computer and Information Science, 661, ed. D. Ignatov, M. Khachay, V. Labunets, N. Loukachevitch, S. Nikolenko, A. Panchenko, A. Savchenko, K. Vorontsov, Springler, 2017, 51–57	→	An exact pseudopolynomial algorithm for a bi-partitioning problem A. V. Kel'manov, V. I. Khandeev Diskretn. Anal. Issled. Oper., 22:4 (2015),  50–62
14.	I. S. Litvinchev, G. Tsedilo, M. Velarde, “Integrirovannaya model marshrutizatsii transportnykh sredstv i postroeniya zon obsluzhivaniya”, Izv. RAN. Teoriya i sistemy upravleniya, 2017, № 6, 74–79	→	Hybrid local search for the heterogenous fixed fleet vehicle routing problem Yu. A. Kochetov, A. V. Khmelev Diskretn. Anal. Issled. Oper., 22:5 (2015),  5–29
15.	O. G. Monakhov, E. A. Monakhova, “Parallelnyi algoritm mnogovariantnogo evolyutsionnogo sinteza nelineinykh modelei”, Sib. zhurn. vychisl. matem., 20:2 (2017), 169–180	→	Searching for record circulant graphs using a parallel genetic algorithm E. A. Monakhova, O. G. Monakhov Diskretn. Anal. Issled. Oper., 22:6 (2015),  29–42
16.	T. I. Fedoryaeva, “Asimptoticheskoe priblizhenie chisla $n$-vershinnykh grafov zadannogo diametra”, Diskretn. analiz i issled. oper., 24:2 (2017), 68–86	→	The diversity vector of balls of a typical graph of small diameter T. I. Fedoryaeva Diskretn. Anal. Issled. Oper., 22:6 (2015),  43–54
17.	I. S. Litvinchev, G. Tsedilo, M. Velarde, “Integrirovannaya model marshrutizatsii transportnykh sredstv i postroeniya zon obsluzhivaniya”, Izv. RAN. Teoriya i sistemy upravleniya, 2017, № 6, 74–79	→	A three-phase heuristic for the vehicle fleet and route optimization A. V. Khmelev Diskretn. Anal. Issled. Oper., 22:6 (2015),  55–77
18.	V. L. Beresnev, A. A. Melnikov, “Verkhnyaya granitsa dlya zadachi konkurentnogo razmescheniya predpriyatii i vybora ob'emov ikh proizvodstva pri alternativnykh stsenariyakh potrebleniya”, Diskretn. analiz i issled. oper., 24:4 (2017), 5–21	→	A capacitated competitive facility location problem V. L. Beresnev, A. A. Melnikov Diskretn. Anal. Issled. Oper., 23:1 (2016),  35–50
19.	I. S. Bykov, A. L. Perezhogin, “O distantsionnykh kodakh Greya”, Diskretn. analiz i issled. oper., 24:2 (2017), 5–17	→	On locally balanced Gray codes I. S. Bykov Diskretn. Anal. Issled. Oper., 23:1 (2016),  51–64
20.	S. Contassot-Vivier, J.-F. Couchot, Ch. Guyeux, P.-C. Heam, “Random walk in a N-cube without Hamiltonian cycle to chaotic pseudorandom number generation: theoretical and practical considerations”, Int. J. Bifurcation Chaos, 27:1 (2017), 1750014	→	On locally balanced Gray codes I. S. Bykov Diskretn. Anal. Issled. Oper., 23:1 (2016),  51–64
1 2  Full list