Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kochetov, Yury Andreevich

Statistics Math-Net.Ru
Total publications: 27
Scientific articles: 27

Number of views:
This page:2616
Abstract pages:10899
Full texts:3468
References:728
Kochetov, Yury Andreevich

Professor
Doctor of physico-mathematical sciences (2010)
Speciality: 05.13.18 (Mathematical modeling, numerical methods, and the program systems)
Birth date: 18.11.1957
E-mail:
Website: http://www.math.nsc.ru/LBRT/k5/kochetov.html
Keywords: operations research, discrete optimization, discrete location problems, local search, metaheuristics, randomized algorithms.
UDC: 519.7, 519.85, 519.874, 519.854, 519.714, 519.86, 519.658, 519.6, 519.866.6
MSC: 90-XX

Subject:

Discrete location problems, Project scheduling problems, Long range strategic planning, Bilevel programming, Metaheuristics, randomized algorithms, Lagrangean relaxations, Decision support systems, Benchmark Library.

Biography

Place of birth: Omsk, Russia. Education: M.D. in Applied Mathematics, Novosibirsk State University, 1980. Ph.D. in Mathematics and Physics, Sobolev Institute of Mathematics, 1988. Advisor: Prof. Vladimir L. Beresnev. Positions: 1988 – date: senior researcher, Sobolev Institute of Mathematics; 1980–1988: research fellow, Sobolev Institute of Mathematics. 1997 – date: associate professor, Novosibirsk State University.

   
Main publications:
  • Yu. A. Kochetov. Veroyatnostnye metody lokalnogo poiska dlya zadach diskretnoi optimizatsii // Diskretnaya matematika i ee prilozheniya. Sbornik lektsii molodezhnykh i nauchnykh shkol po diskretnoi matematike i ee prilozheniyam. M.: MGU, 2001, s. 87–117.
  • E. N. Goncharov, Yu. A. Kochetov. Povedenie veroyatnostnykh zhadnykh algoritmov dlya mnogostadiinoi zadachi razmescheniya // Diskretnyi analiz i issledovanie operatsii, seriya 2, 1999, t. 6, # 1, s. 12–32.
  • Yu. A. Kochetov, A. V. Plyasunov. Polinomialno razreshimyi klass zadach dvukhurovnevogo lineinogo programmirovaniya // Diskretnyi analiz i issledovanie operatsii, seriya 2, 1997, t. 4, # 2, s. 23–33.
  • Kochetov Yu. A., Paschenko M. G. Dinamicheskie zadachi vybora optimalnogo sostava sistemy tekhnicheskikh sredstv // Diskretnyi analiz i issledovanie operatsii, 1995, t. 2, # 1, s. 36–49.
  • Kochetov Yu. A., Paschenko M. G. Nizhnie granitsy v zadache vybora sostava dvukhurovnevoi sistemy tekhnicheskikh sredstv // Diskretnyi analiz i issledovanie operatsii, 1995, t. 2, # 4, s. 32–41.

http://www.mathnet.ru/eng/person17510
List of publications on Google Scholar
https://zbmath.org/authors/?q=ai:kochetov.yu-a
https://mathscinet.ams.org/mathscinet/MRAuthorID/222987
https://elibrary.ru/author_items.asp?spin=6633-0312
http://orcid.org/0000-0001-7123-8647
https://www.scopus.com/authid/detail.url?authorId=24328734700
Full list of publications: http://www.math.nsc.ru/LBRT/k5/Kochetov/publ.html

Publications in Math-Net.Ru
2021
1. Yu. A. Kochetov, N. B. Shamray, “Optimization of the ambulance fleet location and relocation”, Diskretn. Anal. Issled. Oper., 28:2 (2021),  5–34  mathnet; J. Appl. Industr. Math., 15:2 (2021), 234–252  scopus
2019
2. R. Yu. Simanchev, I. V. Urazova, Yu. A. Kochetov, “The branch and cut method for the clique partitioning problem”, Diskretn. Anal. Issled. Oper., 26:3 (2019),  60–87  mathnet; J. Appl. Industr. Math., 13:3 (2019), 539–556  scopus
3. P. A. Kononova, Yu. A. Kochetov, “A local search algorithm for the single machine scheduling problem with setups and a storage”, Diskretn. Anal. Issled. Oper., 26:2 (2019),  60–78  mathnet; J. Appl. Industr. Math., 13:2 (2019), 239–249  scopus
2017
4. Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Genetic local search and hardness of approximation for the server load balancing problem”, Avtomat. i Telemekh., 2017, 3,  51–62  mathnet  mathscinet  elib; Autom. Remote Control, 78:3 (2017), 425–434  isi  scopus
2015
5. Yu. A. Kochetov, A. V. Khmelev, “Hybrid local search for the heterogenous fixed fleet vehicle routing problem”, Diskretn. Anal. Issled. Oper., 22:5 (2015),  5–29  mathnet  mathscinet  elib; J. Appl. Industr. Math., 9:4 (2015), 503–518
6. Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Comparison of metaheuristics for the bilevel facility location and mill pricing problem”, Diskretn. Anal. Issled. Oper., 22:3 (2015),  36–54  mathnet  mathscinet  elib; J. Appl. Industr. Math., 9:3 (2015), 392–401
2014
7. I. A. Davydov, Yu. A. Kochetov, N. Mladenovic, D. Urosevic, “Fast metaheuristics for the discrete $(r|p)$-centroid problem”, Avtomat. i Telemekh., 2014, 4,  106–119  mathnet; Autom. Remote Control, 75:4 (2014), 677–687  isi  scopus
8. I. A. Davydov, P. A. Kononova, Yu. A. Kochetov, “Local search with exponential neighborhood for the servers load balancing problem”, Diskretn. Anal. Issled. Oper., 21:6 (2014),  21–34  mathnet  mathscinet; J. Appl. Industr. Math., 9:1 (2015), 27–35
2012
9. P. A. Kononova, Yu. A. Kochetov, “Variable neighborhood search for two machine flowshop problem with a passive prefetch”, Diskretn. Anal. Issled. Oper., 19:5 (2012),  63–82  mathnet  mathscinet; J. Appl. Industr. Math., 7:1 (2013), 54–67  scopus
10. Yu. A. Kochetov, M. G. Sivykh, A. V. Khmelev, A. V. Yakovlev, “Local search methods for a column permutation problem for the binary matrix”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 12:1 (2012),  91–101  mathnet
11. Yu. A. Kochetov, A. V. Plyasunov, “Genetic local search the graph partitioning problem under cardinality constraints”, Zh. Vychisl. Mat. Mat. Fiz., 52:1 (2012),  164–176  mathnet  mathscinet  zmath  elib; Comput. Math. Math. Phys., 52:1 (2012), 157–167  isi  elib  scopus
2009
12. I. L. Vasiliev, K. B. Klimentova, Yu. A. Kochetov, “New lower bounds for the facility location problem with clients' preferences”, Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1055–1066  mathnet  zmath; Comput. Math. Math. Phys., 49:6 (2009), 1010–1020  isi  scopus
13. A. V. Kononov, Yu. A. Kochetov, A. V. Plyasunov, “Competitive facility location models”, Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1037–1054  mathnet  zmath; Comput. Math. Math. Phys., 49:6 (2009), 994–1009  isi  scopus
2008
14. Yu. A. Kochetov, “Computational bounds for local search in combinatorial optimization”, Zh. Vychisl. Mat. Mat. Fiz., 48:5 (2008),  788–807  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 48:5 (2008), 747–763  isi  scopus
2007
15. E. V. Alekseeva, Yu. A. Kochetov, “Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  3–31  mathnet  mathscinet  zmath
2005
16. Yu. A. Kochetov, M. G. Pashchenko, A. V. Plyasunov, “On the complexity of local search in the $p$-median problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005),  44–71  mathnet  mathscinet  zmath
17. Yu. A. Kochetov, A. A. Stolyar, “New greedy heuristics for the scheduling problem with limited resources”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:1 (2005),  12–36  mathnet  mathscinet  zmath
2003
18. Yu. A. Kochetov, A. A. Stolyar, “The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003),  29–55  mathnet  mathscinet  zmath
19. Yu. A. Kochetov, N. Mladenovich, P. Khansen, “Local search with alternating neighborhoods”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:1 (2003),  11–43  mathnet  mathscinet  zmath
2002
20. Yu. A. Kochetov, A. V. Plyasunov, “The problem of the choice of a series of goods with partial external financing”, Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002),  78–96  mathnet  mathscinet  zmath
21. E. N. Goncharov, Yu. A. Kochetov, “Probabilistic search with exclusions for discrete unconstrained optimization”, Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002),  13–30  mathnet  mathscinet  zmath
1999
22. E. N. Goncharov, Yu. A. Kochetov, “The behavior of probabilistic greedy algorithms for a multistage location problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 6:1 (1999),  12–32  mathnet  mathscinet  zmath
1997
23. Yu. A. Kochetov, A. V. Plyasunov, “A polynomially solvable class of two-level linear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 4:2 (1997),  23–33  mathnet  mathscinet
1995
24. Yu. A. Kochetov, M. G. Pashchenko, “Lower bounds in the problem of the choice of composition of machinery in a two-level system”, Diskretn. Anal. Issled. Oper., 2:4 (1995),  32–41  mathnet  mathscinet  zmath
25. Yu. A. Kochetov, M. G. Pashchenko, “Dynamic problems of the choice of optimal composition of a facility's machinery”, Diskretn. Anal. Issled. Oper., 2:1 (1995),  36–49  mathnet  mathscinet  zmath
1993
26. Yu. A. Kochetov, M. G. Pashchenko, “Лагранжевы релаксации в задаче выбора оптимального состава системы технических средств”, Upravliaemie systemy, 1993, 31,  26–39  mathnet
1984
27. V. L. Beresnev, G. I. Ibragimov, Yu. A. Kochetov, “Algorithm for the solution of a problem of optimal choice of a dynamic series of goods”, Upravliaemie systemy, 1984, 24,  3–19  mathnet  mathscinet  zmath

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