Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kolokolov, Aleksandr Aleksandrovich
Total publications: 75 (75)
in MathSciNet: 28 (28)
in zbMATH: 22 (22)
in Web of Science: 9 (9)
in Scopus: 13 (13)
Cited articles: 27
Citations: 184

Number of views:
This page:2719
Abstract pages:9078
Full texts:4347
References:721
Kolokolov, Aleksandr Aleksandrovich
Professor
Doctor of physico-mathematical sciences (1995)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail: ,
Keywords: discrete optimization
UDC: 519.854, 519.8, 519.853, 519.854.3

Subject:

discrete optimization
   
Main publications:
  1. Kolokolov A.A., Orlovskaya T.G., “Issledovanie odnogo algoritma resheniya zadach tselochislennogo lineinogo programmirovaniya”, Trudy Instituta matematiki i mekhaniki UrO RAN, 16:3 (2010), 140-145

https://www.mathnet.ru/eng/person30329
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/206899
https://orcid.org/0000-0002-1822-1544
https://www.webofscience.com/wos/author/record/D-2733-2013

Full list of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)

   2015
1. A. V. Adelshin, A. A. Kolokolov, “Analysis and solution of discrete optimization problems with logical constraints on the base of $L$-partition approach”, Prikl. Diskr. Mat., 2015, no. 4, 100–108  mathnet  crossref  isi  elib

   2014
2. A. A. Kolokolov, L. A. Zaozerskaya, “Finding and analysis of estimation of the number of iterations in integer programming algorithms using the regular partitioning method”, Russian Math. (Iz. VUZ), 58:1 (2014), 35–46  mathnet  crossref  scopus

   2013
3. Lubov D. Afanasyeva, Alexander A. Kolokolov, “Research of production groups formation problem subject to logical restrictions”, Zhurn. SFU. Ser. Matem. i fiz., 6:2 (2013), 145–149  mathnet
4. A. A. Kolokolov, A. V. Adelshin, D. I. Yagofarova,, “Issledovanie zadach diskretnoi optimizatsii s logicheskimi ogranicheniyami na osnove metoda regulyarnykh razbienii”, Prikladnaya diskretnaya matematika, 1 (2013) , 99-109 pp. http://www.mathnet.ru/links/6491b6080e89c949be845d2f7575dae7/pdm395.pdf  zmath
5. A. A. Kolokolov, A. V. Adelshin, D. I. Yagofarova, “Study of discrete optimization problems with logical constraints based on regular partitions”, Prikl. Diskr. Mat., 2013, no. 1, 99–109  mathnet  elib
6. A. A. Kolokolov, T. G. Orlovskaya, “Investigation of integer programming problems by means of unimodular transformations and regular partitions”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 2, 2013, 193–202  mathnet  mathscinet  elib
7. L. D. Afanasyeva, A.A. Kolokolov, “On solving some production groups formation problems based on discrete optimization”, IV International Conferencese on Optimization Methods and Applisations OPTIMIZATION AND APPLICATIONS (OPTIMA-2013) (Petrovac, Montenegro, September 22 to 28, 2013), eds. V.U. Malkova, Federalnoe gosudarstvennoe byudzhetnoe uchrezhdenie nauki Vychislitelnyi tsentr im. A. A. Dorodnitsyna Rossiiskoi akademii nauk, Moskva, 2013, 98 www.cima.uevora.pt/\optima2013/BookOfAbstracts_2.pdf
8. A.A. Kolokolov, M.F. Korbut, “Reshenie zadachi ob upakovke mnozhestva s ispolzovaniem algoritmov perebora L-klassov i posledovatelnoi optimizatsii”, Mezhdunarodnaya konferentsiya «Diskretnaya optimizatsiya i issledovanie operatsii»: Materialy konferentsii (Novosibirsk, 24 – 28 iyunya 2013 g.) (Novosibirsk, 24 – 28 iyunya 2013 g.), eds. V. L. Beresnev, E. Kh. Gimadi, A. I. Erzin, A. V. Kelmanov, A. A. Kolokolov, A. V. Kononov, E.V. Kon, Izdatelstvo Instituta matematiki, Novosibirsk, 2013, 149 www.math.nsc.ru/\conference/door/2013/Book of abstracts_DOOR_2013.pdf
9. A. A. Kolokolov, T. V. Levanova, Yu. S. Pozdnyakov, “Artificial immune system algorithms for the multivariant problem of the telecommunications centers location”, IIGU Ser. Matematika, 6:1 (2013), 35–44  mathnet

   2012
10. Kolokolov A. A.; Orlovskaya T. G.; Rybalka M. F., “Analysis of integer programming algorithms with L-partition and unimodular transformations”, AUTOMATION AND REMOTE CONTROL, 73:2 (2012), 369-380 http://link.springer.com/article/10.1134/S0005117912020142  mathnet  crossref  mathscinet  zmath  isi  scopus 6
11. A. A. Kolokolov, A. V. Artemova, L.D. Afanaseva, “Reshenie nekotorykh zadach upravleniya personalom s ispolzovaniem metodov optimizatsii”, Dinamika sistem, mekhanizmov i mashin: materialy VIII Mezhdunarodnoi nauchno-tekhnicheskoi konferentsii (Omsk, 12 noyabrya–14 noyabrya 2012 g.), Izdatelstvo OmGTU, Omsk, 2012, 55–58
12. A. A. Kolokolov, T.Yu. Stepanova, E. Ya. Semerkhanova, “O reshenii odnoi zadachi regionalnogo planirovaniya”, Dinamika sistem, mekhanizmov i mashin: materialy VIII Mezhdunarodnoi nauchno-tekhnicheskoi konferentsii (Omsk, 12 noyabrya–14 noyabrya 2012 g.), 3, Izdatelstvo OmGTU, Omsk, 2012, 51–55
13. A. A. Kolokolov, T. V. Levanova, L. A. Zaozerskaya, Yu. S. Pozdnyakov, “Algoritm iskusstvennoi immunnoi sistemy dlya zadachi razmescheniya tsentrov telekommunikatsii”, Dinamika sistem, mekhanizmov i mashin: materialy VIII Mezhdunarodnoi nauchno-tekhnicheskoi konferentsii (Omsk, 12 noyabrya–14 noyabrya 2012 g.), Izdatelstv OmGTU, Omsk, 2012, 49-51

   2011
14. L.A.Zaozerskaya, A.A.Kolokolov, N.G.Gofman, “Bounds on average number of iterations of the algorithms for solving some Boolean programming problems”, Diskretn. Anal. Issled. Operation, 18:3 (2011), 49–64  mathnet  mathscinet  zmath
15. M. V. Devyaterikova, A. A. Kolokolov, N. A. Kosarev, “The analysis of the stability of some integer programming algorithms with respect to the objective function”, Russian Mathematics, 55:4 (2011), 18–25 http://link.springer.com/article/10.3103/S1066369X11040049  mathnet  crossref  mathscinet  elib  scopus
16. A. A. Kolokolov, L.A. Zaozerskaya, “On the Approach of Obtaining the Upper Bounds on the Average Number of Iterations of Some Integer Programming Algorithms”, Proceedings include abstracts of reports presented at II International conference «Optimization and applications» (OPTIMA2011) held at Petrovac, Montenegro, in September 25-October 2, 2011 (Montenegro, Petrovac, September 25–October 2, 2011), eds. A.I. Golikov, Federalnoe gosudarstvennoe byudzhetnoe uchrezhdenie nauki Vychislitelnyi tsentr im. A. A. Dorodnitsyna Rossiiskoi akademii nauk, Moskva, 2011, 137-140  mathscinet
17. A. A. Kolokolov, M. F. Rybalka, T.G. Orlovskaya, “Analysis of some integer programming algorithms based on the method of regular partitions”, Proceedings include abstracts of reports presented at II International conference «Optimization and applications» (OPTIMA2011) held at Petrovac, Montenegro, in September 25-October 2, 2011. (Petrovac, Montenegro, in September 25-October 2, 2011.), eds. A.I. Golikov, Federalnoe gosudarstvennoe byudzhetnoe uchrezhdenie nauki Vychislitelnyi tsentr im. A. A. Dorodnitsyna Rossiiskoi akademii nauk, Moskva, 2011, 133-136
18. A. A. Kolokolov, E. A. Belts, “O reshenii odnoi zadachi razmescheniya predpriyatii s ogranicheniyami na minimalno dopustimye rasstoyaniya”, Trudy XV Baikalskoi mezhdunarodnoi shkoly-seminara «Metody optimizatsii i ikh prilozheniya" (Irkutsk, 23–29 iyunya 2011g.), 4, IDSTU SO RAN, Irkutsk, 2011, 42-47
19. A.A. Kolokolov, T. G. Orlovskaya, “O nekotorykh unimodulyarnykh preobrazovaniyakh dlya zadachi o ryukzake”, Trudy XV Baikalskoi mezhdunarodnoi shkoly-seminara “Metody optimizatsii i ikh prilozheniya” (Irkutsk, 23–29 iyunya 2011g.), IDSTU SO RAN, Irkutsk, 2011, 161-166
20. A. A. Kolokolov, L. D. Shulepova, Yu. S. Serysheva, “Reshenie zadach formirovaniya malykh grupp s uchetom mezhlichnostnykh otnoshenii”, Trudy XV Baikalskoi mezhdunarodnoi shkoly-seminara “Metody optimizatsii i ikh prilozheniya” (Irkutsk, 23 –29 iyunya 2011g.), IDSTU SO RAN, Irkutsk, 2011, 61-66
21. A. A. Kolokolov, T. V. Levanova, Yu.S. Pozdnyakov, “Razrabotka odnogo immunnogo algoritma dlya resheniya zadachi o p-mediane”, Statistika. Modelirovanie. Optimizatsiya: sbornik trudov Vserossiiskoi konferntsii – Chelyabinsk (Chelyabinsk, 28 noyabrya–2 dekabrya 2011 g.), eds. A.V. Panyukov, Izdatelskii tsentr YuUrGU, Chelyabinsk, 2011, 137–140
22. A. A. Kolokolov, L. D. Afanaseva, S. A. Zaborskaya S.A., O. G. Kalinina, “Formirovanie uchebnykh grupp v usloviyakh geterogennosti s ispolzovaniem diskretnoi optimizatsii”, Statistika. Modelirovanie. Optimizatsiya: sbornik trudov Vserossiiskoi konferntsii – Chelyabinsk (Chelyabinsk, 28 noyabrya–2 dekabrya 2011 g.), eds. A. V. Panyukov, Izdatelskii tsentr YuUrGU, 2011, 203–205
23. A. A. Kolokolov, M. F. Rybalka, “Analiz algoritmov perebora L-klassov dlya resheniya zadachi ob upakovke mnozhestva”, XIV Vserossiiskaya konferentsiya «Matematicheskoe programmirovanie i prilozheniya» (MPiP-2011): Informatsionnyi byulleten # 12. (Ekaterinburg, 28 fevralya–4 marta 2011g.), UrO RAN, Ekaterinburg, 2011, 187
24. A. A. Kolokolov, T. G. Orlovskaya, “Metody uluchsheniya L-struktury zadachi o ryukzake”, XIV Vserossiiskaya konferentsiya «Matematicheskoe programmirovanie i prilozheniya» (MPiP-2011): Informatsionnyi byulleten # 12 (Ekaterinburg, 28 fevralya –4 marta 2011g.), UrO RAN, 2011, 186
25. A. A. Kolokolov, L. D. Shulepova, “Ob odnom algoritme resheniya zadachi formirovaniya malykh grupp”, XIV Vserossiiskaya konferentsiya «Matematicheskoe programmirovanie i prilozheniya» (MPiP-2011): Informatsionnyi byulleten # 12 (Ekaterinburg, 28 fevralya–4 marta 2011g.), UrO RAN, 2011, 188

   2010
26. A. A. Kolokolov, T. G. Orlovskaya, “Investigation of one algorithm for solving problems of integer linear programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 3, 2010, 140–145  mathnet  elib
27. M. V. Devyaterikova, A. A. Kolokolov, A. P. Kolosov, “Unimodular transformations for problems of integer programming and analysis of the efficiency of their application”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 2, 2010, 48–62  mathnet  elib
28. Zaozerskaya L. A., Kolokolov A. A., “Estimates for the average number of iterations for some algorithms for solving the set packing problem”, Computational Mathematics and Mathematical Physics, 50:2 (2010), 231–237 http://link.springer.com/article/10.1134/S0965542510020041  mathnet  crossref  mathscinet  adsnasa  isi  elib  scopus
29. Zaozerskaya, L. A.; Kolokolov, A. A., “Estimates for the average number of iterations for some algorithms for solving the set packing problem. (Russian)”, Zh. Vychisl. Mat. Mat. Fiz., 50:2 (2010), 242–248 , MR2681149 (2011f:90081) (Reviewer: Mechthild Opperud), 90C10 (65Y20 90B80 90C57)  mathnet  mathscinet  zmath 6
30. Kolokolov, A. A., “Issledovanie $L$-struktury zadachi o ryukzake [Tekst] : nauchnoe izdanie”, Rossiiskaya konferentsiya “Diskretnaya optimizatsiya i issledovanie operatsii” (Altai, 27 iyunya- 3 iyulya, 2010), ISBN 978-5-86134-172-1, IM SO RAN, Novosibirsk, 2010, 96
31. A. A. Kolokolov, T. G. Orlovskaya, “Issledovanie odnogo algoritma resheniya zadach tselochislennogo lineinogo programmirovaniya”, Trudy Instituta matematiki i mekhaniki UrO RAN, 16:3 (2010) , 140–145 pp. http://wwwrus.imm.uran.ru/Publishing/Archive/  mathnet
32. A. A. Kolokolov, A.V. Kuryachenko, “Dekompozitsionnye algoritmy dlya zadachi razmescheniya predpriyatii s intervalnymi sprosom i predlozheniem”, Diskretnaya optimizatsiya i issledovanie operatsii: rossiiskaya konferentsiya, Altai, 27 iyunya-3 iyulya 2010: [DOOR-2010]: materialy konferentsii (Respublika Altai, 27 iyunya -3 iyulya 2010 g.), eds. V.L. Beresnev, E. Kh. Gimadi, Izdatelstvo Instituta matematiki, Novosibirsk, 2010, 163 math.nsc.ru/\conference/door/2010/DOOR-2010.pdf
33. A. A. Kolokolov, T. V. Levanovoi, A. S. Fedorenko, “Dekompozitsionnyi podkhod k resheniyu dvukhstadiinoi zadachi razmescheniya”, Diskretnaya optimizatsiya i issledovanie operatsii: rossiiskaya konferentsiya, Altai, 27 iyunya-3 iyulya 2010 : [DOOR-2010]: materialy konferentsii (Respublika Altai, 27 iyunya–3 iyulya 2010 g.), eds. V. L. Beresnev, E. Kh. Gimadi, Izdatelstvo Instituta matematiki, Novosibirsk, 2010, 162 math.nsc.ru/\conference/door/2010/DOOR-2010.pdf
34. A.A. Kolokolov, T. G. Orlovskaya, “Issledovanie L-struktury zadachi o ryukzake”, Diskretnaya optimizatsiya i issledovanie operatsii: rossiiskaya konferentsiya, Altai, 27 iyunya-3 iyulya 2010 : [DOOR-2010] : materialy konferentsii (Respublika Altai, 27 iyunya–3 iyulya 2010 g.), eds. V. L. Beresnev, E. Kh. Gimadi, Izdatelstvo Instituta matematiki, Novosibirsk, 2010, 96 math.nsc.ru/\conference/door/2010/DOOR-2010.pdf
35. A. A. Kolokolov, M. F. Rybalka, “Analiz i reshenie odnogo klassa zadach ob upakovke mnozhestva”, Diskretnaya optimizatsiya i issledovanie operatsii: rossiiskaya konferentsiya, Altai, 27 iyunya-3 iyulya 2010: [DOOR-2010] : materialy konferentsii (Respublika Altai, 27 iyunya–3 iyulya 2010 g.), eds. V. L. Beresnev, E. Kh. Gimadi, Izdatelstvo Instituta matematiki, Novosibirsk, 2010, 95 math.nsc.ru/\conference/door/2010/DOOR-2010.pdf
36. A. A. Kolokolov, L. A. Zaozerskaya, N. G. Gofman, “Otsenki srednego chisla iteratsii dlya nekotorykh algoritmov resheniya zadachi o ryukzake”, Intellektualizatsiya obrabotki informatsii: 8-ya mezhdunarodnaya konferentsiya. Respublika Kipr, g.Pafos, 17–24 oktyabrya 2010 g.: Sbornik dokladov. (Respublika Kipr, g. Pafos, 17–24 oktyabrya 2010 g.), Izdatelstvo MAKS-PRESS, Moskva, 2010, 258-261
37. A. A. Kolokolov, T. V. Levanova, A. S. Fedorenko, “Issledovanie matematicheskikh modelei i dekompozitsionnykh algoritmov dlya resheniya dvukhstadiinoi zadachi razmescheniya”, Intellektualizatsiya obrabotki informatsii: 8-ya mezhdunarodnaya konferentsiya. Respublika Kipr, g.Pafos, 17–24 oktyabrya 2010 g.: Sbornik dokladov (Respublika Kipr, g. Pafos, 17–24 oktyabrya 2010 g), Izdatelstvo MAKS-PRESS, 2010, 274-277
38. A. A. Kolokolov, T. V. Levanova, “Ob opyte podgotovki magistrov v institute matematiki i informatsionnykh tekhnologii OmGU”, Problemy i perspektivy perekhoda na urovnevuyu sistemu vysshego professionalnogo obrazovaniya : materialy III ucheb.-metod. konf. (Omsk, 17 noyabrya 2010g.) / Om. gos. un-t im. F. M. Dostoevskogo (Omsk, 17 noyabrya 2010 g.), eds. V. S. Polovinko, T. Yu. Stuken, T. V. Agienko, Izdatelstvovo OmGU, Omsk, 2010, 29-32

   2009
39. Devyaterikova M. V.; Kolokolov A. A.; Kolosov A. P., “L-class enumeration algorithms for a discrete production planning problem with interval resource quantities”, Sponsor(s): IFAC; IFIP; IFORS; IEEE, COMPUTERS & OPERATIONS RESEARCH (St Etienne, FRANCE Date: MAY 17-JUL 19, 2006), Sponsor(s): IFAC; IFIP; IFORS; IEEE, 36 Issue: 2, PERGAMON-ELSEVIER SCIENCE LTD, OXFORD, 2009, 316-324  crossref  mathscinet  zmath  isi  scopus 3
40. Devyaterikova, M. V.; Kolokolov, A. A.; Kolosov, A. P., “L-class enumeration algorithms for a discrete production planning problem with interval resource quantities”, 12th IFAC/IFIP/IFORS/IEEE Symposium on Information Control Problems in Manufacturing (INCOM 2006), COMPUTERS & OPERATIONS RESEARCH, IFAC; IFIP; IFORS; IEEE (St Etienne, FRANCE Date: MAY 17-JUL 19, 2006), 36 Issue: 2, PERGAMON-ELSEVIER SCIENCE LTD,, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND, 2009, 316-324  crossref  mathscinet  zmath  isi  scopus 3
41. A.A. Kolokolov, L.A. Zaozerskaya, “Otsenki srednego chisla iteratsii dlya nekotorykh algoritmov resheniya zadachi o ryukzake”, Vosmaya mezhdunarodnaya konferentsiya «Diskretnye modeli v teorii upravlyayuschikh sistem» (Moskva, 6—9 aprelya, 2009): Elektronnyi sbornik materialov konferentsii (Moskva, 6-9 aprelya, 2009 g.), eds. V.B.Alekseev, V.A. Zakharov, Fakultet VMK MGU im. M.V.Lomonosova, Moskva, 2009, 76-69 http://www.ofinko.ru/files/pdf/conf/proceedings
42. A. A. Kolokolov, L. A. Zaozerskaya, “On Average Number of Iterations of Some Algorithms for Solving the Set Packing Problem”, Information Control Problems in Manufacturing: Volume ¹13 (Moskow, June 3-5, 2009), 13, eds. N. Bakhtadze, A. Dolgui, International Federation of Automatic Control, Laxenburg, Austria, 2009, 1510-1513  crossref  mathscinet  elib  scopus
43. A. A. Kolokolov, L. A. Zaozerskaya L. A., “Otsenki chisla iteratsii dlya nekotorykh algoritmov tselochislennogo programmirovaniya”, Mezhdunarodnaya nauchnaya konferentsiya “Diskretnaya matematika, algebra i ikh prilozheniya”, 19-22 oktyabrya 2009 g., Minsk: tezisy dokladov (Minsk, 19–22 oktyabrya, 2009 g.), eds. V.V. Lepin, IM NAN Belorusii, Minsk, 2009, 95-97
44. A. A. Kolokolov, L. A. Zaozerskaya, “Postroenie otsenok chisla iteratsii algoritmov tselochislennogo programmirovaniya na osnove metoda regulyarnykh razbienii”, IV Vserossiiskaya konferentsiya «Problemy optimizatsii i ekonomicheskie prilozheniya»: Materialy konferentsii (Omsk, 29 iyunya – 4 iyulya 2009) (Omsk, 29 iyunya–4 iyulya 2009 g.), eds. A.V. Adelshin, M.V. Devyaterikova, A.V. Eremeev, G.G. Zabudskii, L.A. Zaozerskaya, V.P. Ilev, A.A. K, Izdatelstvo Nasledie. Dialog-Sibir, Omsk, 2009, 62–67 www.spsl.nsc.ru/\FullText/konfe/Omsk-09.pdf
45. A. A. Kolokolov, M. F. Rybalka, “Razrabotka i analiz algoritmov resheniya zadachi ob upakovke mnozhestva s ispolzovaniem L-razbieniya”, IV Vserossiiskaya konferentsiya «Problemy optimizatsii i ekonomicheskie prilozheniya»: Materialy konferentsii (Omsk, 29 iyunya – 4 iyulya 2009) (Omsk, 29 iyunya–4 iyulya 2009 g.), eds. A.V. Adelshin, M.V. Devyaterikova, A.V. Eremeev, G.G. Zabudskii, L.A. Zaozerskaya, V.P. Ilev, A.A. K, Izdatelstvo Nasledie. Dialog-Sibir, Omsk, 2009, 138 www.spsl.nsc.ru/\FullText/konfe/Omsk-09.pdf
46. A. A. Kolokolov, A.V. Kuryachenko, “Issledovanie i reshenie odnoi zadachi razmescheniya predpriyatii s intervalnymi dannymi”, IV Vserossiiskaya konferentsiya «Problemy optimizatsii i ekonomicheskie prilozheniya»: Materialy konferentsii (Omsk, 29 iyunya – 4 iyulya 2009) (Omsk, 29 iyunya–4 iyulya 2009 g), Izdatelstvo Nasledie. Dialog-Sibir, Omsk, 2009, 135 www.spsl.nsc.ru/\FullText/konfe/Omsk-09.pdf
47. A.A. Kolokolov, T. G. Orlovskaya, “Issledovanie z-algoritma dlya resheniya nekotorykh zadach tselochislennogo programmirovaniya”, IV Vserossiiskaya konferentsiya «Problemy optimizatsii i ekonomicheskie prilozheniya»: Materialy konferentsii (Omsk, 29 iyunya – 4 iyulya 2009) (Omsk, 29 iyunya–4 iyulya 2009 g.), eds. A.V. Adelshin, M.V. Devyaterikova, A.V. Eremeev, G.G. Zabudskii, L.A. Zaozerskaya, V.P. Ilev, A.A. K, Izdatelstvo Nasledie. Dialog-Sibir, Omsk, 2009, 137 www.spsl.nsc.ru/\FullText/konfe/Omsk-09.pdf  mathscinet
48. A. A. Kolokolov, M. F. Rybalka, “Issledovanie i reshenie zadachi ob upakovke mnozhestva blochnoi struktury”, Dinamika sistem, mekhanizmov i mashin: materialy VII Mezhdunarodnoi nauchno-tekhnicheskoi konferentsii (Omsk, 10 noyabrya–12 noyabrya 2009 g.), 3, eds. A. V. Kosykh, O. I. Babenko, Izdatelstvo OmGTU, Omsk, 2009, 55-59
49. A. A. Kolokolov, A.V. Kuryachenko, “Razrabotka algoritmov resheniya odnoi zadachi razmescheniya predpriyatii s intervalnymi dannymi”, Dinamika sistem, mekhanizmov i mashin: materialy VII Mezhdunarodnoi nauchno-tekhnicheskoi konferentsii (Omsk, 10 noyabrya–12 noyabrya 2009), 3, eds. A. V. Kosykh, O. I. Babenko, Izdatelstvo OmGTU, Omsk, 2009, 47-51
50. A.A. Kolokolov, T. G. Orlovskaya, “O regulyarnosti odnogo algoritma resheniya zadach tselochislennogo programmirovaniya”, Dinamika sistem, mekhanizmov i mashin: materialy VII Mezhdunarodnoi nauchno-tekhnicheskoi konferentsii (Omsk, 10 noyabrya–12 noyabrya 2009 g.), 3, eds. A. V. Kosykh, O. I. Babenko, Izdatelstvo OmGTU, Omsk, 2009, 51–55

   2008
51. O. N. Guseletova, A. A. Kolokolov, “Discrete optimization with logical constraints for design of complex products”, Autom. Remote Control, 69:10 (2008), 1808–1813  mathnet  crossref  mathscinet  zmath  isi  elib  elib  scopus
52. M. V. Devyaterikova, A. A. Kolokolov, A. P. Kolosov, “One approach to solving a discrete production planning problem with interval data”, Proceedings of the Steklov Institute of Mathematics, 263:2 (2008), 37–46 http://link.springer.com/article/10.1134/S0081543808060059  mathnet  crossref  mathscinet  zmath  isi  elib  scopus

   2006
53. Kolokolov, Alexander; Kosarev, Nikolay, “Analysis of decomposition algorithms with Benders cuts for $p$ -median problem.”, J. Math. Model. Algorithms, 5:2 (2006), 189–199 , MR2231564 (2007a:90045) 90C11 (90C57)  crossref  mathscinet  zmath  elib  scopus 6
54. Dolgui, Alexandre; Eremeev, Anton; Gordon, Valery; Kolokolov, Alexander, “Guest editorial: Discrete optimization methods in production and logistics”, J. Math. Model. Algorithms, 5:2 (2006), 139–141 , 90-06 (90B06 90B30)  crossref  mathscinet  elib  scopus
55. Devyaterikova, M. V.; Kolokolov, A. A., “On the stability of some integer programming algorithms. 34,”, MR2192372 (2006g:90062), Oper. Res. Lett., 34:2 (2006), 149–154 , 90C10 (90C31)  crossref  mathscinet  isi  elib  scopus 5
56. Kolokolov, Alexander; Kosarev, Nikolay, “Analysis of decomposition algorithms with Benders cuts for $p$ -median problem”, J. Math. Model. Algorithms, 5:2 (2006), 189–199 , MR2231564 (2007a:90045) 90C11 (90C57)  crossref  mathscinet  zmath  elib  scopus 6

   2004
57. M. V. Devyaterikova, A. A. Kolokolov, “Stability analysis of some discrete optimization algorithms”, Autom. Remote Control, 65:3 (2004), 401–406  mathnet  crossref  mathscinet  zmath  isi  elib  scopus

   2003
58. M. V. Devyaterikova, A. A. Kolokolov, “On the stability of some integer programming algorithms”, Russian Math. (Iz. VUZ), 47:12 (2003), 38–45  mathnet  mathscinet  zmath

   2002
59. Dolgui, A.; Eremeev, A.; Kolokolov, A.; Sigaev, V, “A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines.”, MR2236126 (2006m:90135), J. Math. Model. Algorithms, 1:2 (2002), 89–104 , 90C27 (90B30)  crossref  mathscinet  zmath  scopus 57

   2001
60. Devyaterikova, M.V.; Kolokolov, A.A., “Analysis of $L$-structure stability of convex integer programming problems. (English) Fleischmann, Bernhard (ed.) et al., Operations research proceedings 2000. Selected papers of the symposium, OR 2000,”, OPERATIONS RESEARCH PROCEEDINGS 2000 (Dresden, Germany, September 9-12, 2000.), Springer., Berlin, 2001, 49-54  crossref  mathscinet  zmath  isi 2
61. Kolokolov A.A., Eremeev A.V., Zaozerskaya L.A., “Metody resheniya zadachi o pokrytii mnozhestva”, Algoritmicheskii analiz neustoichivykh zadach., ISBN 5-7996-0099-1, Izd-vo UrGU, Ekaterinburg, 2001, 225-226

   2000
62. A. A. Kolokolov, M. V. Devyaterikova, “Analysis of the stability of an $L$-partition of sets in a finite-dimensional space”, Diskretn. Anal. Issled. Oper., 7:2 (2000), 47–53  mathnet  mathscinet  zmath
63. A. V. Eremeev, L. A. Zaozerskaya, A. A. Kolokolov, “The set covering problem: complexity, algorithms, and experimental investigations”, Diskretn. Anal. Issled. Oper., 7:2 (2000), 22–46  mathnet  mathscinet  zmath
64. Kolokolov, A. A.; Devyaterikova, M. V., “Analysis of the stability of an $L$ -partition of sets in a finite-dimensional space. (Russian) International Conference DAOR'2000 (Russian) (Novosibirsk). Diskretn. Anal. Issled. Oper. Ser. 2 7 (2000), no. 2, 47–53, 119, 05A18”, MR1815971 (2001j:05012), International Conference DAOR'2000 (Russian) (Novosibirsk)., Diskretn. Anal. Issled. Oper. 2, 7, no. 2, 2000, 47–53 , 05A18  mathscinet  zmath
65. Kolokolov, A. A.; Devyaterikova, M. V., “Analysis of the stability of an $L$ -partition of sets in a finite-dimensional space. (Russian) International Conference DAOR'2000 (Russian) (Novosibirsk). Diskretn. Anal. Issled. Oper. Ser. 2 7 (2000), no. 2, 47–53, 119, 05A18”, MR1815971 (2001j:05012), International Conference DAOR'2000 (Russian) (Novosibirsk)., Diskretn. Anal. Issled. Oper. 2, 7, no. 2, 2000, 47–53 , 05A18  mathscinet  zmath

   1996
66. Kolokolov A. A., “Regular Partitions and Cuts in Integer Programming”, Discrete Analysis and Operations Research Mathematics and Its Applications, 355 (1996) , 59-79 pp. http://link.springer.com/chapter/10.1007

   1994
67. A. A. Kolokolov, “Regular partitions and truncations in integer programming”, Sibirsk. Zh. Issled. Oper., 1:2 (1994), 18–39  mathnet  mathscinet  zmath
68. Kolokolov, Alexander A., “The the $L$-structure of integer linear programming problems. (English)”, Zbl 0811.90074Henry, Jacques (ed.) et al., MSC2000: *90C10, System modelling and optimization. Proceedings of the 16th IFIP-TC7 conference (Compiègne, France, July 5-9, 1993.), Lect. Notes Control Inf. Sci., 197, London: Springer-Verlag., London, 1994, 756-760  crossref  mathscinet  zmath 1

   1993
69. A. A. Kolokolov, “Application of regular partitions in integer programming”, Russian Math. (Iz. VUZ), 37:12 (1993), 10–29  mathnet  mathscinet  zmath

   1984
70. Kolokolov, A.A.; Tsepkova, E.V., “An upper estimate of the number of regular cutting planes for a family of problems on a cone. (Russian).”, Zbl 0589.90057, Upr. Sist., 25 (1984), 75-79 , MSC2000: *90C10, Reviewer: M.Frumkin  mathscinet  zmath
71. A. A. Kolokolov, E. V. Tsepkova, “Upper bound on the number of regular truncations for a family of problems on a cone”, Upravliaemie systemy, 1984, no. 25, 75–79  mathnet  mathscinet  zmath

   1983
72. A. A. Kolokolov, “Lower bound for the number of iterations for a class of truncation algorithms”, Upravliaemie systemy, 1983, no. 23, 64–69  mathnet  mathscinet  zmath
73. O. A. Zablotskaya, A. A. Kolokolov, “Completely regular truncations in Boolean programming”, Upravliaemie systemy, 1983, no. 23, 55–63  mathnet  mathscinet  zmath

   1981
74. A. A. Kolokolov, “Regular cuttings in the solution of problems of integer optimization”, Upravliaemie systemy, 1981, no. 21, 18–25  mathnet  mathscinet  zmath

   1970
75. Kolokolov, A. A.; Hohljuk, V. I., “Two direct algorithms of integer linear programming. (Russian)”, Optimal. Planirovanie, 16 (1970), 33–46. , MR0293996 (45 #3071) (Reviewer: G. Bar), 90C10  mathscinet  zmath

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024