RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Maksimenko, Aleksandr Nikolaevich

Statistics Math-Net.Ru
Total publications: 14
Scientific articles: 14
Presentations: 2

Number of views:
This page:806
Abstract pages:3985
Full texts:947
References:396
Associate professor
Candidate of physico-mathematical sciences
E-mail: , ,

http://www.mathnet.ru/eng/person51495
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/788720
http://orcid.org/0000-0002-0887-1500

Publications in Math-Net.Ru
2020
1. A. N. Maksimenko, “Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm”, Model. Anal. Inform. Sist., 27:1 (2020),  72–85  mathnet
2017
2. A. N. Maksimenko, “On a family of 0/1-polytopes with an NP-complete criterion for vertex nonadjacency relation”, Diskr. Mat., 29:2 (2017),  29–39  mathnet  elib; Discrete Math. Appl., 29:1 (2019), 7–14  isi  scopus
3. A. N. Maksimenko, “Boolean quadric polytopes are faces of linear ordering polytopes”, Sib. Èlektron. Mat. Izv., 14 (2017),  640–646  mathnet
2016
4. A. N. Maksimenko, “Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes”, Diskretn. Anal. Issled. Oper., 23:3 (2016),  61–80  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:3 (2016), 370–379  scopus
5. A. N. Maksimenko, “A special role of Boolean quadratic polytopes among other combinatorial polytopes”, Model. Anal. Inform. Sist., 23:1 (2016),  23–40  mathnet  mathscinet  elib
2014
6. A. N. Maksimenko, “Characteristics of complexity: clique number of a polytope graph and rectangle covering number”, Model. Anal. Inform. Sist., 21:5 (2014),  116–130  mathnet
2013
7. A. N. Maksimenko, “Traveling salesman polytopes and cut polytopes. Affine reducibility”, Diskr. Mat., 25:2 (2013),  31–38  mathnet  mathscinet  elib; Discrete Math. Appl., 23:3-4 (2013), 251–259  scopus
8. A. N. Maksimenko, “The common face of some $0/1$-polytopes with NP-complete nonadjacency relation”, Fundam. Prikl. Mat., 18:2 (2013),  105–118  mathnet  mathscinet; J. Math. Sci., 203:6 (2014), 823–832  scopus
9. A. N. Maksimenko, “$k$-neighborly faces of the Boolean quadric polytopes”, Fundam. Prikl. Mat., 18:2 (2013),  95–103  mathnet  mathscinet; J. Math. Sci., 203:6 (2014), 816–822  scopus
2012
10. A. N. Maksimenko, “An analog of the Cook theorem for polytopes”, Izv. Vyssh. Uchebn. Zaved. Mat., 2012, 8,  34–42  mathnet  mathscinet; Russian Math. (Iz. VUZ), 56:8 (2012), 28–34  scopus
2011
11. A. N. Maksimenko, “SAT polytopes are faces of polytopes of the traveling salesman problem”, Diskretn. Anal. Issled. Oper., 18:3 (2011),  76–83  mathnet  mathscinet  zmath
2010
12. A. N. Maksimenko, “On the number of facets of a 2-neighborly polytope”, Model. Anal. Inform. Sist., 17:1 (2010),  76–82  mathnet
2009
13. A. N. Maksimenko, “The diameter of the ridge-graph of a cyclic polytope”, Diskr. Mat., 21:2 (2009),  146–152  mathnet  mathscinet  elib; Discrete Math. Appl., 19:1 (2009), 47–53  scopus
2004
14. A. N. Maksimenko, “Polyhedron combinatorial properties associated with the shortest path problem”, Zh. Vychisl. Mat. Mat. Fiz., 44:9 (2004),  1693–1696  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 44:9 (2004), 1611–1614

Presentations in Math-Net.Ru
1. Комбинаторные свойства многогранников задач комбинаторной оптимизации
A. N. Maksimenko
MIPT Interdepartmental Seminar on Discrete Mathematics
February 26, 2019 18:30
2. Анализ сложности многогранников задач комбинаторной оптимизации
A. N. Maksimenko
Differential geometry and applications
March 14, 2016 16:45

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021