{"id":"https://openalex.org/W4210327971","doi":"https://doi.org/10.3103/s0146411621070269","title":"The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm","display_name":"The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm","publication_year":2021,"publication_date":"2021-12-01","ids":{"openalex":"https://openalex.org/W4210327971","doi":"https://doi.org/10.3103/s0146411621070269"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411621070269","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411621070269","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042813130","display_name":"A. N. Maksimenko","orcid":"https://orcid.org/0000-0002-0887-1500"},"institutions":[{"id":"https://openalex.org/I198371094","display_name":"Yaroslavl State University","ror":"https://ror.org/044s2fj67","country_code":"RU","type":"education","lineage":["https://openalex.org/I198371094"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A. N. Maksimenko","raw_affiliation_strings":["Demidov Yaroslavl State University, 150003, Yaroslavl, Russia","Demidov Yaroslavl State University, Yaroslavl, Russia"],"raw_orcid":"https://orcid.org/0000-0002-0887-1500","affiliations":[{"raw_affiliation_string":"Demidov Yaroslavl State University, 150003, Yaroslavl, Russia","institution_ids":["https://openalex.org/I198371094"]},{"raw_affiliation_string":"Demidov Yaroslavl State University, Yaroslavl, Russia","institution_ids":["https://openalex.org/I198371094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042813130"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.14,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59250481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"55","issue":"7","first_page":"816","last_page":"826"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9767000079154968,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9767000079154968,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.970300018787384,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9692000150680542,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7908896803855896},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.773521900177002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.746841549873352},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7396851181983948},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.527725100517273}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7908896803855896},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.773521900177002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.746841549873352},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7396851181983948},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.527725100517273}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411621070269","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411621070269","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1979802116","https://openalex.org/W2123241324","https://openalex.org/W2270504252","https://openalex.org/W2613459475","https://openalex.org/W2742229541","https://openalex.org/W2766768406","https://openalex.org/W2778312199","https://openalex.org/W3103657596","https://openalex.org/W3133279294","https://openalex.org/W3178944186","https://openalex.org/W6817190398"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302","https://openalex.org/W4309336419","https://openalex.org/W2392203420","https://openalex.org/W2940865666"],"abstract_inverted_index":{"This":[0],"article":[1,176],"considers":[2],"the":[3,26,44,80,84,94,102,117,131,135,153,172,179,183,192],"concept":[4,18],"of":[5,19,29,36,43,68,83,97,101,105,119,174,194],"a":[6,20,30,166,188],"linear":[7],"separation":[8],"direct":[9,21,69,120,167,189,195],"algorithm":[10,22,133,163,181],"introduced":[11],"by":[12,79,140],"V.A.":[13],"Bondarenko":[14],"in":[15,150,170],"1983.":[16],"The":[17,34,114],"is":[23,71,75,122,164,186,197],"defined":[24],"using":[25],"solution":[27,85],"graph":[28,38],"combinatorial":[31,111,128],"optimization":[32,112],"problem.":[33,45],"vertices":[35],"this":[37,162,175],"are":[39,48,53,63,99],"all":[40],"feasible":[41],"solutions":[42,47,62],"Two":[46],"called":[49],"adjacent":[50],"if":[51],"there":[52,89],"input":[54],"data":[55],"for":[56,134,156,182],"which":[57,98],"these":[58,61,157],"and":[59,124,147],"only":[60],"optimal.":[64],"A":[65],"key":[66],"feature":[67],"algorithms":[70,121,196],"that":[72,116,161,178],"their":[73],"complexity":[74],"bounded":[76],"from":[77],"below":[78],"clique":[81,103],"number":[82],"graph.":[86],"In":[87],"2015\u20132018,":[88],"were":[90],"five":[91],"articles":[92],"published,":[93],"main":[95,154],"results":[96],"estimates":[100],"numbers":[104],"polyhedron":[106],"graphs":[107],"associated":[108],"with":[109],"various":[110],"problems.":[113],"thesis":[115],"class":[118,193],"broad":[123,200],"includes":[125],"many":[126],"classical":[127],"algorithms,":[129],"including":[130],"branch-and-bound":[132],"traveling":[136],"salesman":[137],"problem":[138,185],"proposed":[139],"J.D.C.":[141],"Little,":[142],"K.G.":[143],"Murty,":[144],"D.W.":[145],"Sweeney,":[146],"C.":[148],"Karel":[149],"1963,":[151],"was":[152],"motivation":[155],"articles.":[158],"We":[159],"show":[160],"not":[165,187,198],"algorithm.":[168,190],"Earlier,":[169],"2014,":[171],"author":[173],"showed":[177],"Hungarian":[180],"assignment":[184],"Therefore,":[191],"as":[199,201],"previously":[202],"assumed.":[203]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}