{"id":"https://openalex.org/W2913850717","doi":"https://doi.org/10.1007/978-3-030-22629-9_18","title":"On Vertex Adjacencies in the Polytope of Pyramidal Tours with Step-Backs","display_name":"On Vertex Adjacencies in the Polytope of Pyramidal Tours with Step-Backs","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2913850717","doi":"https://doi.org/10.1007/978-3-030-22629-9_18","mag":"2913850717"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-22629-9_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-22629-9_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1901.09361","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":"Andrei Nikolaev","raw_affiliation_strings":["P.G. Demidov Yaroslavl State University, Yaroslavl, Russia"],"raw_orcid":"https://orcid.org/0000-0003-4705-2409","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":1,"corresponding_author_ids":["https://openalex.org/A5053965200"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.2631,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.91987248,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"247","last_page":"263"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9679999947547913,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7574632167816162},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7233483791351318},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6646563410758972},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6461696028709412},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5479141473770142},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49074968695640564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4899222254753113},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41600868105888367},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4150713384151459},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.41130921244621277},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.39920443296432495},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3397948741912842},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2196299433708191},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.167810320854187},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08238717913627625},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.07593238353729248}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7574632167816162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7233483791351318},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6646563410758972},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6461696028709412},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5479141473770142},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49074968695640564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4899222254753113},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41600868105888367},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4150713384151459},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.41130921244621277},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39920443296432495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3397948741912842},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2196299433708191},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.167810320854187},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08238717913627625},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.07593238353729248}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-22629-9_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-22629-9_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:1901.09361","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.09361","pdf_url":"https://arxiv.org/pdf/1901.09361","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:1901.09361","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.09361","pdf_url":"https://arxiv.org/pdf/1901.09361","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W34983847","https://openalex.org/W1548698003","https://openalex.org/W1975317208","https://openalex.org/W1992340583","https://openalex.org/W2000825158","https://openalex.org/W2002016358","https://openalex.org/W2015981446","https://openalex.org/W2031274566","https://openalex.org/W2076551133","https://openalex.org/W2086332879","https://openalex.org/W2091507391","https://openalex.org/W2103026976","https://openalex.org/W2117157235","https://openalex.org/W2270504252","https://openalex.org/W2324108981","https://openalex.org/W2613459475","https://openalex.org/W2742229541","https://openalex.org/W2765771319","https://openalex.org/W2766768406","https://openalex.org/W2769166639","https://openalex.org/W2793416418","https://openalex.org/W2807705129","https://openalex.org/W3103657596","https://openalex.org/W3105089140","https://openalex.org/W3178944186","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2098081711","https://openalex.org/W2056091804","https://openalex.org/W2079789648","https://openalex.org/W2987987562","https://openalex.org/W4241541331","https://openalex.org/W2123688402","https://openalex.org/W2319088853","https://openalex.org/W2300145982","https://openalex.org/W2082133472","https://openalex.org/W1564185521"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
