{"id":"https://openalex.org/W3212386711","doi":"https://doi.org/10.1007/978-3-030-91059-4_10","title":"Problem-Specific Branch-and-Bound Algorithms for\u00a0the\u00a0Precedence Constrained Generalized Traveling Salesman Problem","display_name":"Problem-Specific Branch-and-Bound Algorithms for\u00a0the\u00a0Precedence Constrained Generalized Traveling Salesman Problem","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3212386711","doi":"https://doi.org/10.1007/978-3-030-91059-4_10","mag":"3212386711"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-91059-4_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-91059-4_10","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":"conference-paper","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/A5050865451","display_name":"Michael Khachay","orcid":"https://orcid.org/0000-0003-3555-0080"},"institutions":[{"id":"https://openalex.org/I20119556","display_name":"Omsk State Technical University","ror":"https://ror.org/01kzjg088","country_code":"RU","type":"education","lineage":["https://openalex.org/I20119556"]},{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Michael Khachay","raw_affiliation_strings":["Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","Omsk Technical University, Omsk, Russia"],"raw_orcid":"https://orcid.org/0000-0003-3555-0080","affiliations":[{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Omsk Technical University, Omsk, Russia","institution_ids":["https://openalex.org/I20119556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012319247","display_name":"Stanislav Ukolov","orcid":"https://orcid.org/0000-0002-9946-6446"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Stanislav Ukolov","raw_affiliation_strings":["Ural Federal University, Ekaterinburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-9946-6446","affiliations":[{"raw_affiliation_string":"Ural Federal University, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075059819","display_name":"Alexander Petunin","orcid":"https://orcid.org/0000-0003-2540-1305"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]},{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Petunin","raw_affiliation_strings":["Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","Ural Federal University, Ekaterinburg, Russia"],"raw_orcid":"https://orcid.org/0000-0003-2540-1305","affiliations":[{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Ural Federal University, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050865451"],"corresponding_institution_ids":["https://openalex.org/I20119556","https://openalex.org/I4210105350"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.1546,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.93103058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"136","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9957000017166138,"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.9929999709129333,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9131466746330261},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7306740283966064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7050686478614807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48178717494010925},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.47665268182754517},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4736833870410919},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4604542553424835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39624452590942383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24143770337104797}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9131466746330261},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7306740283966064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7050686478614807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48178717494010925},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.47665268182754517},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4736833870410919},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4604542553424835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39624452590942383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24143770337104797}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-91059-4_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-91059-4_10","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1517470327","https://openalex.org/W1571087346","https://openalex.org/W1968492936","https://openalex.org/W1969186119","https://openalex.org/W1983714309","https://openalex.org/W1985225156","https://openalex.org/W2000973164","https://openalex.org/W2018269848","https://openalex.org/W2023947722","https://openalex.org/W2055569927","https://openalex.org/W2100115208","https://openalex.org/W2160004927","https://openalex.org/W2163557644","https://openalex.org/W2405668439","https://openalex.org/W2470413114","https://openalex.org/W2513271974","https://openalex.org/W2582089955","https://openalex.org/W2614564353","https://openalex.org/W2769788311","https://openalex.org/W2783956140","https://openalex.org/W2789645577","https://openalex.org/W2793061008","https://openalex.org/W2808432410","https://openalex.org/W2930154544","https://openalex.org/W2932662651","https://openalex.org/W3005294261","https://openalex.org/W3096434675"],"related_works":["https://openalex.org/W2043449725","https://openalex.org/W4220987199","https://openalex.org/W2308371765","https://openalex.org/W2356976268","https://openalex.org/W810420948","https://openalex.org/W2184672982","https://openalex.org/W4312198704","https://openalex.org/W2993902031","https://openalex.org/W2697482356","https://openalex.org/W2318575556"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}