{"id":"https://openalex.org/W2794514739","doi":"https://doi.org/10.1007/s10732-018-9370-4","title":"All Colors Shortest Path problem on trees","display_name":"All Colors Shortest Path problem on trees","publication_year":2018,"publication_date":"2018-03-30","ids":{"openalex":"https://openalex.org/W2794514739","doi":"https://doi.org/10.1007/s10732-018-9370-4","mag":"2794514739"},"language":"en","primary_location":{"id":"doi:10.1007/s10732-018-9370-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10732-018-9370-4","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","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/A5082126391","display_name":"Mehmet Berkehan Ak\u00e7ay","orcid":"https://orcid.org/0000-0001-9039-5453"},"institutions":[{"id":"https://openalex.org/I15059493","display_name":"\u0130zmir University of Economics","ror":"https://ror.org/04hjr4202","country_code":"TR","type":"education","lineage":["https://openalex.org/I15059493"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Mehmet Berkehan Ak\u00e7ay","raw_affiliation_strings":["Department of Software Engineering, Izmir University of Economics, 35330, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Engineering, Izmir University of Economics, 35330, Izmir, Turkey","institution_ids":["https://openalex.org/I15059493"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078601797","display_name":"H\u00fcseyin Akcan","orcid":"https://orcid.org/0000-0002-5145-7778"},"institutions":[{"id":"https://openalex.org/I15059493","display_name":"\u0130zmir University of Economics","ror":"https://ror.org/04hjr4202","country_code":"TR","type":"education","lineage":["https://openalex.org/I15059493"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"H\u00fcseyin Akcan","raw_affiliation_strings":["Department of Software Engineering, Izmir University of Economics, 35330, Izmir, Turkey"],"raw_orcid":"https://orcid.org/0000-0002-5145-7778","affiliations":[{"raw_affiliation_string":"Department of Software Engineering, Izmir University of Economics, 35330, Izmir, Turkey","institution_ids":["https://openalex.org/I15059493"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061655950","display_name":"Cem Evrendilek","orcid":"https://orcid.org/0000-0003-1204-2817"},"institutions":[{"id":"https://openalex.org/I15059493","display_name":"\u0130zmir University of Economics","ror":"https://ror.org/04hjr4202","country_code":"TR","type":"education","lineage":["https://openalex.org/I15059493"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Cem Evrendilek","raw_affiliation_strings":["Department of Computer Engineering, Izmir University of Economics, 35330, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Izmir University of Economics, 35330, Izmir, Turkey","institution_ids":["https://openalex.org/I15059493"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082126391"],"corresponding_institution_ids":["https://openalex.org/I15059493"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5044,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71547553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"4","first_page":"617","last_page":"644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9959999918937683,"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.9959999918937683,"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.9775999784469604,"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/T12288","display_name":"Optimization and Search Problems","score":0.9710000157356262,"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/mathematics","display_name":"Mathematics","score":0.6846407651901245},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6498859524726868},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5944491624832153},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5915638208389282},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5410086512565613},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5193173289299011},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.48535266518592834},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46735242009162903},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4607495069503784},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4234582781791687},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.40697038173675537},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34750857949256897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31118887662887573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23446571826934814},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.07587003707885742},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06696292757987976}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6846407651901245},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6498859524726868},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5944491624832153},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5915638208389282},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5410086512565613},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5193173289299011},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.48535266518592834},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46735242009162903},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4607495069503784},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4234582781791687},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.40697038173675537},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34750857949256897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31118887662887573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23446571826934814},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.07587003707885742},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06696292757987976},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10732-018-9370-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10732-018-9370-4","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:joheur:v:24:y:2018:i:4:d:10.1007_s10732-018-9370-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10732-018-9370-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W1591968161","https://openalex.org/W1963899113","https://openalex.org/W2008229997","https://openalex.org/W2011039300","https://openalex.org/W2017602820","https://openalex.org/W2021005221","https://openalex.org/W2032789430","https://openalex.org/W2077405310","https://openalex.org/W2078336410","https://openalex.org/W2083974195","https://openalex.org/W2099816848","https://openalex.org/W2110105948","https://openalex.org/W2111415774","https://openalex.org/W2120988215","https://openalex.org/W2145457833","https://openalex.org/W2172255557","https://openalex.org/W2240749562","https://openalex.org/W2295961103","https://openalex.org/W2324108981","https://openalex.org/W2610052675","https://openalex.org/W2611804663","https://openalex.org/W2619911072","https://openalex.org/W2745422985","https://openalex.org/W2884277687","https://openalex.org/W3023540311","https://openalex.org/W4249318479","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4243934122","https://openalex.org/W2035016254","https://openalex.org/W4302819359","https://openalex.org/W3100114454","https://openalex.org/W1963627056","https://openalex.org/W2507810539","https://openalex.org/W1973873435"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}