{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:59:31Z","timestamp":1773615571792,"version":"3.50.1"},"reference-count":12,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.3103\/s0146411621070269","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T09:15:43Z","timestamp":1643706943000},"page":"816-826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm"],"prefix":"10.3103","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0887-1500","authenticated-orcid":false,"given":"A. N.","family":"Maksimenko","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"7408_CR1","doi-asserted-by":"publisher","first-page":"682","DOI":"10.3103\/S0146411617070033","volume":"51","author":"V. Bondarenko","year":"2017","unstructured":"Bondarenko, V., Nikolaev, A., and Shovgenov, D., 1-skeletons of the spanning tree problems with additional constraints, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 682\u2013688. \u00a0https:\/\/doi.org\/10.3103\/S0146411617070033","journal-title":"Autom. Control Comput. Sci."},{"key":"7408_CR2","doi-asserted-by":"publisher","first-page":"7863650","DOI":"10.1155\/2016\/7863650","volume":"2016","author":"V. Bondarenko","year":"2016","unstructured":"Bondarenko, V. and Nikolaev, A., On graphs of the cone decompositions for the min-cut and max-cut problems, Int. J. Math. Math. Sci., 2016, vol. 2016, p. 7863650. \u00a0https:\/\/doi.org\/10.1155\/2016\/7863650","journal-title":"Int. J. Math. Math. Sci."},{"key":"7408_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.endm.2017.06.030","volume":"61","author":"V. Bondarenko","year":"2017","unstructured":"Bondarenko, V. and Nikolaev, A., Some properties of the skeleton of the pyramidal tours polytope, Electron. Notes Discrete Math., 2017, vol. 61, pp. 131\u2013137. \u00a0https:\/\/doi.org\/10.1016\/j.endm.2017.06.030","journal-title":"Electron. Notes Discrete Math."},{"key":"7408_CR4","doi-asserted-by":"publisher","first-page":"576","DOI":"10.3103\/S0146411617070276","volume":"51","author":"V.A. Bondarenko","year":"2017","unstructured":"Bondarenko, V.A., Nikolaev, A.V., and Shovgenov, D.A., Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 576\u2013585. \u00a0https:\/\/doi.org\/10.3103\/S0146411617070276","journal-title":"Autom. Control Comput. Sci."},{"key":"7408_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1134\/S1990478918010027","volume":"12","author":"V.A. Bondarenko","year":"2018","unstructured":"Bondarenko, V.A. and Nikolaev, A.V., On the skeleton of the polytope of pyramidal tours, J. Appl. Ind. Math., 2018, vol. 12, no. 1, pp. 9\u201318. \u00a0https:\/\/doi.org\/10.1134\/S1990478918010027","journal-title":"J. Appl. Ind. Math."},{"key":"7408_CR6","first-page":"1137","volume":"44","author":"V.A. Bondarenko","year":"1983","unstructured":"Bondarenko, V.A., Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms, Autom. Remote Control, 1983, vol. 44, no. 9, pp. 1137\u20131142.","journal-title":"Autom. Remote Control"},{"key":"7408_CR7","unstructured":"Bondarenko, V., Geometrical methods of systems analysis in combinatorial optimization, Doctor Sci. (Phys.-Math.) Dissertation, Yaroslavl\u2019: Demidov Yaroslavl State Univ., 1993."},{"key":"7408_CR8","unstructured":"Bondarenko, V. and Maksimenko, A., Geometricheskie konstruktsii i slozhnost\u2019 v kombinatornoi optimizatsii (Geometric Structures and Complexity in Combinatorial Optimization), Moscow: URSS, 2008."},{"key":"7408_CR9","doi-asserted-by":"publisher","first-page":"116","DOI":"10.18255\/1818-1015-2014-5-116-130","volume":"21","author":"A.N. Maksimenko","year":"2014","unstructured":"Maksimenko, A.N., Characteristics of complexity: clique number of a polytope graph and rectangle covering number, Mod. Anal. Inf. Sist., 2014, vol. 21, no. 5, pp. 116\u2013130.","journal-title":"Mod. Anal. Inf. Sist."},{"key":"7408_CR10","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J.D.C. Little","year":"1963","unstructured":"Little, J.D.C., Murty, K.G., Sweeney, D.W., and Karel, C., An algorithm for the traveling salesman problem, Oper. Res., 1963, vol. 11, no. 6, pp. 972\u2013989.","journal-title":"Oper. Res."},{"key":"7408_CR11","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E. Reingold","year":"1977","unstructured":"Reingold, E., Nievergelt, J., and Deo, N., Combinatorial Algorithms: Theory and Practice, Prentice Hall College Div., 1977."},{"key":"7408_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BF01585502","volume":"7","author":"M.W. Padberg","year":"1974","unstructured":"Padberg, M.W. and Rao, M.R., The travelling salesman problem and a class of polyhedra of diameter two, Math. Program., 1974, vol. 7, no. 1, pp. 32\u201345. \u00a0https:\/\/doi.org\/10.1007\/BF01585502","journal-title":"Math. Program"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621070269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411621070269","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621070269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:01:43Z","timestamp":1773612103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411621070269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["7408"],"URL":"https:\/\/doi.org\/10.3103\/s0146411621070269","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"3 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author declares that he has no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}