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.
Yu. A. Kochetov, A. V. Ratushnyi, “Upper and lower bounds for the optimum in a temporal bin packing problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 30:1 (2024), 109–127
2022
2.
S. M. Shperling, Yu. A. Kochetov, “A knapsack problem for rectangles under the gravity center constraints”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 102–115
3.
A. V. Ratushnyi, Yu. A. Kochetov, “A matheuristic for minimization of waiting time for trailers with uncertain arrival times”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 85–101
4.
Yu. A. Kochetov, V. A. Legkokonets, A. A. Panin, A. V. Plyasunov, L. V. Som, “The problem of gas treatment and transportation”, Diskretn. Anal. Issled. Oper., 29:2 (2022), 5–23
2021
5.
Yu. A. Kochetov, N. B. Shamray, “Optimization of the ambulance fleet location and relocation”, Diskretn. Anal. Issled. Oper., 28:2 (2021), 5–34; J. Appl. Industr. Math., 15:2 (2021), 234–252
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; J. Appl. Industr. Math., 13:3 (2019), 539–556
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; J. Appl. Industr. Math., 13:2 (2019), 239–249
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, no. 3, 51–62; Autom. Remote Control, 78:3 (2017), 425–434
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; J. Appl. Industr. Math., 9:4 (2015), 503–518
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; J. Appl. Industr. Math., 9:3 (2015), 392–401
I. A. Davydov, Yu. A. Kochetov, N. Mladenovic, D. Urosevic, “Fast metaheuristics for the discrete $(r|p)$-centroid problem”, Avtomat. i Telemekh., 2014, no. 4, 106–119; Autom. Remote Control, 75:4 (2014), 677–687
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; J. Appl. Industr. Math., 9:1 (2015), 27–35
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; J. Appl. Industr. Math., 7:1 (2013), 54–67
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
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; Comput. Math. Math. Phys., 52:1 (2012), 157–167
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; Comput. Math. Math. Phys., 49:6 (2009), 1010–1020
E. V. Alekseeva, Yu. A. Kochetov, “Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 3–31
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
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
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
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
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
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
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
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
29.
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
1993
30.
Yu. A. Kochetov, M. G. Pashchenko, “Лагранжевы релаксации в задаче выбора оптимального состава системы технических средств”, Upravliaemie systemy, 1993, no. 31, 26–39
1984
31.
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, no. 24, 3–19
2022
32.
Yu. A. Kochetov, A. V. Kononov, N. A. Kochetova, P. A. Kononova, “International Conference “Mathematical Optimization Theory and Operations Research” (MOTOR 2022)”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 5–6
