Sergeev S I

Publications in Math-Net.Ru

1. Approximate algorithms for the traveling salesman problem. II
   
   Avtomat. i Telemekh., 2015, no. 3,  125–134
2. Maximum travelling salesman problem. I
   
   Avtomat. i Telemekh., 2014, no. 12,  101–124
3. Nonlinear resolving functions for the travelling salesman problem
   
   Avtomat. i Telemekh., 2013, no. 6,  101–120
4. The symmetric travelling salesman problem II. New low bounds
   
   Avtomat. i Telemekh., 2010, no. 4,  150–168
5. The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal $2$-matching
   
   Avtomat. i Telemekh., 2009, no. 11,  148–160
6. New lower bounds for the triplanar assignment problem. Use of the classical model
   
   Avtomat. i Telemekh., 2008, no. 12,  53–75
7. Hybrid control systems and the dynamic traveling salesman problem
   
   Avtomat. i Telemekh., 2008, no. 1,  45–54
8. Algorithms to solve some problems of concave programming with linear constraints
   
   Avtomat. i Telemekh., 2007, no. 3,  33–46
9. Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
   
   Avtomat. i Telemekh., 2006, no. 7,  27–40
10. Discrete optimization by optimal control methods. II. The static traveling salesman problem
    
    Avtomat. i Telemekh., 2006, no. 6,  106–112
11. Discrete optimization by optimal control methods. I. Separable problems
    
    Avtomat. i Telemekh., 2006, no. 4,  42–52
12. The three-dimensional assignment and partition problems. New lower bounds
    
    Avtomat. i Telemekh., 2006, no. 2,  80–89
13. Improved lower bounds for the quadratic assignment problem
    
    Avtomat. i Telemekh., 2004, no. 11,  49–63
14. Reachability Sets of a Class of Multistep Control Processes: Their Design
    
    Avtomat. i Telemekh., 2002, no. 6,  57–63
15. Some block problems of discrete optimization. II. Problems with a quasiblock structure
    
    Avtomat. i Telemekh., 2000, no. 9,  120–128
16. Some block problems of discrete optimization. I. A general approach to the formation of decomposition solution schemes
    
    Avtomat. i Telemekh., 2000, no. 8,  98–114
17. The quadratic assignment problem. II. An improved Gilmore-Lawler algorithm
    
    Avtomat. i Telemekh., 1999, no. 9,  137–143
18. The quadratic assignment problem. I. New lower bounds in a dual assignment scheme
    
    Avtomat. i Telemekh., 1999, no. 8,  127–147
19. Optimality Conditions in Discrete Optimization
    
    Avtomat. i Telemekh., 1997, no. 3,  3–19
20. Stability of Separable Problems of Discrete Optimization
    
    Avtomat. i Telemekh., 1997, no. 1,  63–73
21. Algorithms for the minimax problem of the travelling salesman. II. Dual approach
    
    Avtomat. i Telemekh., 1995, no. 8,  124–141
22. Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming
    
    Avtomat. i Telemekh., 1995, no. 7,  144–150
23. Estimation of the duality gap for a discrete optimization problem
    
    Avtomat. i Telemekh., 1995, no. 3,  29–33
24. Computational algorithms for solving the traveling salesman problem. II. A new lower bound
    
    Avtomat. i Telemekh., 1994, no. 6,  106–114
25. Computational algorithms for solving the traveling salesman problem. I. A general classification scheme
    
    Avtomat. i Telemekh., 1994, no. 5,  66–79
26. Layout algorithm for computer-aided design of double-sided printed circuit boards
    
    Avtomat. i Telemekh., 1990, no. 7,  115–124
27. Algorithms for solving a separable problem of discrete optimization
    
    Zh. Vychisl. Mat. Mat. Fiz., 30:8 (1990),  1273–1275
28. The traveling salesman problem. Approximate algorithms
    
    Avtomat. i Telemekh., 1989, no. 11,  3–26
29. The traveling salesman's problem. Exact methods
    
    Avtomat. i Telemekh., 1989, no. 10,  3–29
30. The traveling salesman problem. Issues in theory
    
    Avtomat. i Telemekh., 1989, no. 9,  3–33
31. A new lower bound for the quadratic assignment problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 27:12 (1987),  1802–1811
32. Computing algorithms for solution of some linear and linear integer programming problems. IV
    
    Avtomat. i Telemekh., 1981, no. 4,  103–112
33. Computing algorithms for solution of some linear and linear integer programming problems. III
    
    Avtomat. i Telemekh., 1981, no. 3,  83–94
34. Computing algorithms for solution of some linear and linear integer programming problems. II
    
    Avtomat. i Telemekh., 1981, no. 1,  86–96
35. Computing algorithms for solution of some problems in linear and linear integer programming. I
    
    Avtomat. i Telemekh., 1980, no. 12,  86–96