Kochetov Yury Andreevich

Publications in Math-Net.Ru

1. 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
2. A knapsack problem for rectangles under the gravity center constraints
   
   Diskretn. Anal. Issled. Oper., 29:3 (2022),  102–115
3. A matheuristic for minimization of waiting time for trailers with uncertain arrival times
   
   Diskretn. Anal. Issled. Oper., 29:3 (2022),  85–101
4. The problem of gas treatment and transportation
   
   Diskretn. Anal. Issled. Oper., 29:2 (2022),  5–23
5. Optimization of the ambulance fleet location and relocation
   
   Diskretn. Anal. Issled. Oper., 28:2 (2021),  5–34
6. The branch and cut method for the clique partitioning problem
   
   Diskretn. Anal. Issled. Oper., 26:3 (2019),  60–87
7. A local search algorithm for the single machine scheduling problem with setups and a storage
   
   Diskretn. Anal. Issled. Oper., 26:2 (2019),  60–78
8. Genetic local search and hardness of approximation for the server load balancing problem
   
   Avtomat. i Telemekh., 2017, no. 3,  51–62
9. Hybrid local search for the heterogenous fixed fleet vehicle routing problem
   
   Diskretn. Anal. Issled. Oper., 22:5 (2015),  5–29
10. Comparison of metaheuristics for the bilevel facility location and mill pricing problem
    
    Diskretn. Anal. Issled. Oper., 22:3 (2015),  36–54
11. Fast metaheuristics for the discrete $(r|p)$-centroid problem
    
    Avtomat. i Telemekh., 2014, no. 4,  106–119
12. Local search with exponential neighborhood for the servers load balancing problem
    
    Diskretn. Anal. Issled. Oper., 21:6 (2014),  21–34
13. Variable neighborhood search for two machine flowshop problem with a passive prefetch
    
    Diskretn. Anal. Issled. Oper., 19:5 (2012),  63–82
14. 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
15. Genetic local search the graph partitioning problem under cardinality constraints
    
    Zh. Vychisl. Mat. Mat. Fiz., 52:1 (2012),  164–176
16. New lower bounds for the facility location problem with clients' preferences
    
    Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1055–1066
17. Competitive facility location models
    
    Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1037–1054
18. Computational bounds for local search in combinatorial optimization
    
    Zh. Vychisl. Mat. Mat. Fiz., 48:5 (2008),  788–807
19. Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  3–31
20. On the complexity of local search in the $p$-median problem
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005),  44–71
21. New greedy heuristics for the scheduling problem with limited resources
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 12:1 (2005),  12–36
22. 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
23. Local search with alternating neighborhoods
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 10:1 (2003),  11–43
24. 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
25. Probabilistic search with exclusions for discrete unconstrained optimization
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002),  13–30
26. The behavior of probabilistic greedy algorithms for a multistage location problem
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 6:1 (1999),  12–32
27. A polynomially solvable class of two-level linear programming problems
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 4:2 (1997),  23–33
28. 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. Dynamic problems of the choice of optimal composition of a facility's machinery
    
    Diskretn. Anal. Issled. Oper., 2:1 (1995),  36–49
30. Лагранжевы релаксации в задаче выбора оптимального состава системы технических средств
    
    Upravliaemie systemy, 1993, no. 31,  26–39
31. Algorithm for the solution of a problem of optimal choice of a dynamic series of goods
    
    Upravliaemie systemy, 1984, no. 24,  3–19


32. International Conference “Mathematical Optimization Theory and Operations Research” (MOTOR 2022)
    
    Diskretn. Anal. Issled. Oper., 29:3 (2022),  5–6