{"id":"https://openalex.org/W3091098346","doi":"https://doi.org/10.1007/s10878-020-00652-7","title":"Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search","display_name":"Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search","publication_year":2020,"publication_date":"2020-01-14","ids":{"openalex":"https://openalex.org/W3091098346","doi":"https://doi.org/10.1007/s10878-020-00652-7","mag":"3091098346"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2001.04683","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.04683","pdf_url":"https://arxiv.org/pdf/2001.04683","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2001.04683","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053965200","display_name":"Andrei V. Nikolaev","orcid":null},"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":"Nikolaev, Andrei","raw_affiliation_strings":["P. G. Demidov Yaroslavl State University, Yaroslavl, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"P. G. Demidov Yaroslavl State University, Yaroslavl, Russia","institution_ids":["https://openalex.org/I198371094"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025836477","display_name":"Anna Kozlova","orcid":"https://orcid.org/0000-0001-6280-3325"},"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":false,"raw_author_name":"Kozlova, Anna","raw_affiliation_strings":["P. G. Demidov Yaroslavl State University, Yaroslavl, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"P. G. Demidov Yaroslavl State University, Yaroslavl, Russia","institution_ids":["https://openalex.org/I198371094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053965200"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.867,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79957448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.7765193581581116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.73548823595047},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.6968467235565186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6442692279815674},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5821542143821716},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.57041335105896},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43664926290512085},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.4332078695297241},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.43177884817123413},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.42248648405075073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4218025207519531},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32735031843185425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2776351571083069}],"concepts":[{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.7765193581581116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.73548823595047},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.6968467235565186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6442692279815674},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5821542143821716},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.57041335105896},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43664926290512085},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.4332078695297241},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.43177884817123413},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.42248648405075073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4218025207519531},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32735031843185425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2776351571083069}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:arXiv.org:2001.04683","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.04683","pdf_url":"https://arxiv.org/pdf/2001.04683","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2001.04683","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.04683","pdf_url":"https://arxiv.org/pdf/2001.04683","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G6241680004","display_name":null,"funder_award_id":"MK-2620.2018.1","funder_id":"https://openalex.org/F4320335603","funder_display_name":"Council on grants of the President of the Russian Federation"}],"funders":[{"id":"https://openalex.org/F4320335603","display_name":"Council on grants of the President of the Russian Federation","ror":"https://ror.org/05gxnjj05"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1504855246","https://openalex.org/W1548698003","https://openalex.org/W1603350720","https://openalex.org/W1979802116","https://openalex.org/W1985101250","https://openalex.org/W1992340583","https://openalex.org/W2000825158","https://openalex.org/W2002352982","https://openalex.org/W2003813631","https://openalex.org/W2010334716","https://openalex.org/W2015981446","https://openalex.org/W2023683195","https://openalex.org/W2024060531","https://openalex.org/W2035613389","https://openalex.org/W2067818563","https://openalex.org/W2076551133","https://openalex.org/W2084413241","https://openalex.org/W2086332879","https://openalex.org/W2091507391","https://openalex.org/W2103026976","https://openalex.org/W2117157235","https://openalex.org/W2149025218","https://openalex.org/W2154926368","https://openalex.org/W2157529519","https://openalex.org/W2171367973","https://openalex.org/W2317309498","https://openalex.org/W2324108981","https://openalex.org/W2516530272","https://openalex.org/W2590614448","https://openalex.org/W2765771319","https://openalex.org/W2781884304","https://openalex.org/W2902620155","https://openalex.org/W2913850717","https://openalex.org/W2953563151","https://openalex.org/W2961450311","https://openalex.org/W2963248084","https://openalex.org/W3103781801","https://openalex.org/W3178944186","https://openalex.org/W4289694552"],"related_works":["https://openalex.org/W34983847","https://openalex.org/W4387272283","https://openalex.org/W4299647289","https://openalex.org/W2155631825","https://openalex.org/W4285598206","https://openalex.org/W2952856011","https://openalex.org/W3186549454","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957"],"abstract_inverted_index":{"We":[0,41],"consider":[1],"a":[2,8,38,43,56,76],"Hamiltonian":[3,13,34,94],"decomposition":[4,35],"problem":[5,36,52],"of":[6,24,60],"partitioning":[7],"regular":[9],"graph":[10],"into":[11],"edge-disjoint":[12],"cycles.":[14],"A":[15],"sufficient":[16],"condition":[17],"for":[18,50],"vertex":[19],"adjacency":[20],"in":[21,37],"the":[22,25,33,61,79],"1-skeleton":[23],"traveling":[26],"salesperson":[27],"polytope":[28],"can":[29],"be":[30],"formulated":[31],"as":[32],"4-regular":[39],"multigraph.":[40],"introduce":[42],"heuristic":[44],"general":[45],"variable":[46],"neighborhood":[47],"search":[48],"algorithm":[49,74],"this":[51],"based":[53],"on":[54,89,97],"finding":[55],"vertex-disjoint":[57],"cycle":[58,70],"cover":[59],"multigraph":[62],"through":[63],"reduction":[64],"to":[65],"perfect":[66],"matching":[67],"and":[68,86,92,96],"several":[69],"merging":[71],"operations.":[72],"The":[73],"has":[75],"one-sided":[77],"error:":[78],"answer":[80],"\"not":[81],"adjacent\"":[82],"is":[83],"always":[84],"correct,":[85],"was":[87],"tested":[88],"random":[90],"directed":[91],"undirected":[93],"cycles":[95],"pyramidal":[98],"tours.":[99]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2020-10-08T00:00:00"}