Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Sergeev, S I
Statistics Math-Net.Ru
Total publications: 35
Scientific articles: 35

Number of views:
This page:526
Abstract pages:13055
Full texts:5455
References:717
Doctor of physico-mathematical sciences

https://www.mathnet.ru/eng/person60297
List of publications on Google Scholar
https://zbmath.org/authors/ai:sergeev.s-i
https://mathscinet.ams.org/mathscinet/MRAuthorID/250016

Publications in Math-Net.Ru Citations
2015
1. S. I. Sergeev, “Approximate algorithms for the traveling salesman problem. II”, Avtomat. i Telemekh., 2015, no. 3,  125–134  mathnet  elib; Autom. Remote Control, 76:3 (2015), 472–479  isi  elib  scopus 2
2014
2. S. I. Sergeev, “Maximum travelling salesman problem. I”, Avtomat. i Telemekh., 2014, no. 12,  101–124  mathnet; Autom. Remote Control, 75:12 (2014), 2170–2189  isi  scopus 1
2013
3. S. I. Sergeev, “Nonlinear resolving functions for the travelling salesman problem”, Avtomat. i Telemekh., 2013, no. 6,  101–120  mathnet  mathscinet; Autom. Remote Control, 74:6 (2013), 978–994  isi  scopus 4
2010
4. S. I. Sergeev, “The symmetric travelling salesman problem II. New low bounds”, Avtomat. i Telemekh., 2010, no. 4,  150–168  mathnet  mathscinet  zmath; Autom. Remote Control, 71:4 (2010), 681–696  isi  scopus 5
2009
5. S. I. Sergeev, “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  mathnet  mathscinet  zmath; Autom. Remote Control, 70:11 (2009), 1901–1912  isi  scopus 3
2008
6. S. I. Sergeev, “New lower bounds for the triplanar assignment problem. Use of the classical model”, Avtomat. i Telemekh., 2008, no. 12,  53–75  mathnet  mathscinet  zmath; Autom. Remote Control, 69:12 (2008), 2039–2060  isi  scopus 4
7. S. I. Sergeev, “Hybrid control systems and the dynamic traveling salesman problem”, Avtomat. i Telemekh., 2008, no. 1,  45–54  mathnet  mathscinet  zmath; Autom. Remote Control, 69:1 (2008), 42–51  isi  scopus 10
2007
8. S. I. Sergeev, “Algorithms to solve some problems of concave programming with linear constraints”, Avtomat. i Telemekh., 2007, no. 3,  33–46  mathnet  mathscinet  zmath; Autom. Remote Control, 68:3 (2007), 399–412  scopus 2
2006
9. S. I. Sergeev, “Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem”, Avtomat. i Telemekh., 2006, no. 7,  27–40  mathnet  mathscinet  zmath; Autom. Remote Control, 67:7 (2006), 1039–1050  scopus 1
10. S. I. Sergeev, “Discrete optimization by optimal control methods. II. The static traveling salesman problem”, Avtomat. i Telemekh., 2006, no. 6,  106–112  mathnet  mathscinet  zmath; Autom. Remote Control, 67:6 (2006), 927–932  scopus 1
11. S. I. Sergeev, “Discrete optimization by optimal control methods. I. Separable problems”, Avtomat. i Telemekh., 2006, no. 4,  42–52  mathnet  mathscinet  zmath; Autom. Remote Control, 67:4 (2006), 552–561  scopus 4
12. S. I. Sergeev, “The three-dimensional assignment and partition problems. New lower bounds”, Avtomat. i Telemekh., 2006, no. 2,  80–89  mathnet  mathscinet  zmath; Autom. Remote Control, 67:2 (2006), 242–250  scopus 3
2004
13. S. I. Sergeev, “Improved lower bounds for the quadratic assignment problem”, Avtomat. i Telemekh., 2004, no. 11,  49–63  mathnet  mathscinet  zmath; Autom. Remote Control, 65:11 (2004), 1733–1746  isi  scopus 5
2002
14. S. I. Sergeev, “Reachability Sets of a Class of Multistep Control Processes: Their Design”, Avtomat. i Telemekh., 2002, no. 6,  57–63  mathnet  mathscinet  zmath; Autom. Remote Control, 63:6 (2002), 919–925  isi  scopus 2
2000
15. S. I. Sergeev, “Some block problems of discrete optimization. II. Problems with a quasiblock structure”, Avtomat. i Telemekh., 2000, no. 9,  120–128  mathnet  mathscinet  zmath; Autom. Remote Control, 61:9 (2000), 1522–1529 1
16. S. I. Sergeev, “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  mathnet  mathscinet  zmath; Autom. Remote Control, 61:8 (2000), 1328–1343 1
1999
17. S. I. Sergeev, “The quadratic assignment problem. II. An improved Gilmore-Lawler algorithm”, Avtomat. i Telemekh., 1999, no. 9,  137–143  mathnet  mathscinet  zmath; Autom. Remote Control, 60:9 (1999), 1326–1331  isi 7
18. S. I. Sergeev, “The quadratic assignment problem. I. New lower bounds in a dual assignment scheme”, Avtomat. i Telemekh., 1999, no. 8,  127–147  mathnet  mathscinet  zmath; Autom. Remote Control, 60:8 (1999), 1162–1178  isi 16
1997
19. S. I. Sergeev, “Optimality Conditions in Discrete Optimization”, Avtomat. i Telemekh., 1997, no. 3,  3–19  mathnet  mathscinet  zmath; Autom. Remote Control, 58:3 (1997), 329–342 2
20. S. I. Sergeev, “Stability of Separable Problems of Discrete Optimization”, Avtomat. i Telemekh., 1997, no. 1,  63–73  mathnet  mathscinet  zmath; Autom. Remote Control, 58:1 (1997), 49–57
1995
21. S. I. Sergeev, A. V. Chernyshenko, “Algorithms for the minimax problem of the travelling salesman. II. Dual approach”, Avtomat. i Telemekh., 1995, no. 8,  124–141  mathnet  mathscinet  zmath; Autom. Remote Control, 56:8 (1995), 1155–1168 6
22. S. I. Sergeev, “Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming”, Avtomat. i Telemekh., 1995, no. 7,  144–150  mathnet  mathscinet  zmath; Autom. Remote Control, 56:7 (1995), 1027–1032 11
23. S. I. Sergeev, “Estimation of the duality gap for a discrete optimization problem”, Avtomat. i Telemekh., 1995, no. 3,  29–33  mathnet  mathscinet  zmath; Autom. Remote Control, 56:3 (1995), 331–334
1994
24. S. I. Sergeev, “Computational algorithms for solving the traveling salesman problem. II. A new lower bound”, Avtomat. i Telemekh., 1994, no. 6,  106–114  mathnet  mathscinet  zmath; Autom. Remote Control, 55:6 (1994), 861–868 9
25. S. I. Sergeev, “Computational algorithms for solving the traveling salesman problem. I. A general classification scheme”, Avtomat. i Telemekh., 1994, no. 5,  66–79  mathnet  mathscinet  zmath; Autom. Remote Control, 55:5 (1994), 669–680 6
1990
26. A. L. Gerasimov, S. I. Sergeev, “Layout algorithm for computer-aided design of double-sided printed circuit boards”, Avtomat. i Telemekh., 1990, no. 7,  115–124  mathnet  zmath; Autom. Remote Control, 51:7 (1990), 953–959
27. S. I. Sergeev, “Algorithms for solving a separable problem of discrete optimization”, Zh. Vychisl. Mat. Mat. Fiz., 30:8 (1990),  1273–1275  mathnet  zmath; U.S.S.R. Comput. Math. Math. Phys., 30:4 (1990), 218–219 2
1989
28. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Approximate algorithms”, Avtomat. i Telemekh., 1989, no. 11,  3–26  mathnet  mathscinet  zmath; Autom. Remote Control, 50:11 (1989), 1459–1479 66
29. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman's problem. Exact methods”, Avtomat. i Telemekh., 1989, no. 10,  3–29  mathnet  mathscinet  zmath; Autom. Remote Control, 50:10 (1989), 1303–1324 67
30. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Issues in theory”, Avtomat. i Telemekh., 1989, no. 9,  3–33  mathnet  mathscinet  zmath; Autom. Remote Control, 50:9 (1989), 1147–1173 77
1987
31. S. I. Sergeev, “A new lower bound for the quadratic assignment problem”, Zh. Vychisl. Mat. Mat. Fiz., 27:12 (1987),  1802–1811  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 27:6 (1987), 130–136 1
1981
32. V. F. Krotov, S. I. Sergeev, “Computing algorithms for solution of some linear and linear integer programming problems. IV”, Avtomat. i Telemekh., 1981, no. 4,  103–112  mathnet  mathscinet  zmath; Autom. Remote Control, 42:4 (1981), 494–501 13
33. V. F. Krotov, S. I. Sergeev, “Computing algorithms for solution of some linear and linear integer programming problems. III”, Avtomat. i Telemekh., 1981, no. 3,  83–94  mathnet  mathscinet  zmath; Autom. Remote Control, 42:3 (1981), 339–349 13
34. V. F. Krotov, S. I. Sergeev, “Computing algorithms for solution of some linear and linear integer programming problems. II”, Avtomat. i Telemekh., 1981, no. 1,  86–96  mathnet  mathscinet  zmath; Autom. Remote Control, 42:1 (1981), 67–75 14
1980
35. V. F. Krotov, S. I. Sergeev, “Computing algorithms for solution of some problems in linear and linear integer programming. I”, Avtomat. i Telemekh., 1980, no. 12,  86–96  mathnet  mathscinet  zmath; Autom. Remote Control, 41:12 (1981), 1693–1701 14

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