Kononov Alexander Veniaminovich

Publications in Math-Net.Ru

1. Minimizing makespan for parallelizable jobs with energy constraint
   
   Sib. Èlektron. Mat. Izv., 19:2 (2022),  586–600
2. A bilevel competitive location and pricing model with nonuniform split of demand
   
   Diskretn. Anal. Issled. Oper., 26:3 (2019),  27–45
3. Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
   
   Sib. Èlektron. Mat. Izv., 16 (2019),  249–257
4. On minimizing dataset transfer time in an acyclic network with four servers
   
   Diskretn. Anal. Issled. Oper., 23:4 (2016),  5–25
5. On a two-machine routing open shop problem on a two-node network
   
   Diskretn. Anal. Issled. Oper., 19:2 (2012),  54–74
6. Structural properties of optimal schedules with preemption
   
   Diskretn. Anal. Issled. Oper., 16:1 (2009),  3–36
7. Competitive facility location models
   
   Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1037–1054
8. Computational complexity of the graph approximation problem
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  3–15
9. A polynomially solvable case of a two-stage open shop problem with three machines
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001),  23–39
10. On the complexity of determining a connected prescribed coloring of the vertices of a graph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  21–46
11. Problems in scheduling theory on a single machine with job durations proportional to an arbitrary function
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:3 (1998),  17–37
12. Combinatorial complexity of scheduling jobs with simple linear growth of processing times
    
    Diskretn. Anal. Issled. Oper., 3:2 (1996),  15–32
13. On the scheduling of jobs on one machine with nonlinearly dependent processing times
    
    Diskretn. Anal. Issled. Oper., 2:1 (1995),  21–35
14. Алгоритм с оценкой для задачи минимизации максимального запаздывания на однородных машинах
    
    Upravliaemie systemy, 1993, no. 31,  19–25


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