{"id":"https://openalex.org/W2993722689","doi":"https://doi.org/10.1007/s10707-019-00385-8","title":"Constrained shortest path problems in bi-colored graphs: a label-setting approach","display_name":"Constrained shortest path problems in bi-colored graphs: a label-setting approach","publication_year":2019,"publication_date":"2019-12-03","ids":{"openalex":"https://openalex.org/W2993722689","doi":"https://doi.org/10.1007/s10707-019-00385-8","mag":"2993722689"},"language":"en","primary_location":{"id":"doi:10.1007/s10707-019-00385-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10707-019-00385-8","pdf_url":null,"source":{"id":"https://openalex.org/S4210168194","display_name":"GeoInformatica","issn_l":"1384-6175","issn":["1384-6175","1573-7624"],"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":"GeoInformatica","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/A5018263122","display_name":"Amin Aliabdi","orcid":null},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Amin AliAbdi","raw_affiliation_strings":["Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, 15875-4413, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, 15875-4413, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027094623","display_name":"Ali Mohades","orcid":"https://orcid.org/0000-0002-6118-2245"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Ali Mohades","raw_affiliation_strings":["Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, 15875-4413, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, 15875-4413, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065062849","display_name":"Mansoor Davoodi","orcid":"https://orcid.org/0000-0003-1010-4121"},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mansoor Davoodi","raw_affiliation_strings":["Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, 45137-66731, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, 45137-66731, Iran","institution_ids":["https://openalex.org/I161028277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027094623"],"corresponding_institution_ids":["https://openalex.org/I158248296"],"apc_list":{"value":2590,"currency":"EUR","value_usd":3190},"apc_paid":null,"fwci":0.668,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70204479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"25","issue":"3","first_page":"513","last_page":"531"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9879000186920166,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.7411519885063171},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.677236795425415},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5262880921363831},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.45575422048568726},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45476725697517395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45364993810653687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4513005316257477},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.43388330936431885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4292450249195099},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4240688681602478},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3576439619064331},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2746214270591736}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7411519885063171},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.677236795425415},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5262880921363831},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.45575422048568726},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45476725697517395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45364993810653687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4513005316257477},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.43388330936431885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4292450249195099},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4240688681602478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3576439619064331},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2746214270591736},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10707-019-00385-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10707-019-00385-8","pdf_url":null,"source":{"id":"https://openalex.org/S4210168194","display_name":"GeoInformatica","issn_l":"1384-6175","issn":["1384-6175","1573-7624"],"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":"GeoInformatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8199999928474426,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W104675468","https://openalex.org/W156039568","https://openalex.org/W328847996","https://openalex.org/W1424654272","https://openalex.org/W1568832590","https://openalex.org/W1576264942","https://openalex.org/W1614580925","https://openalex.org/W1779869868","https://openalex.org/W1988399927","https://openalex.org/W1990336586","https://openalex.org/W2008003976","https://openalex.org/W2011282943","https://openalex.org/W2022258268","https://openalex.org/W2036900823","https://openalex.org/W2045174204","https://openalex.org/W2061701207","https://openalex.org/W2074117023","https://openalex.org/W2076222538","https://openalex.org/W2096774592","https://openalex.org/W2104317982","https://openalex.org/W2106784610","https://openalex.org/W2109923933","https://openalex.org/W2119257015","https://openalex.org/W2125401948","https://openalex.org/W2127456145","https://openalex.org/W2130626677","https://openalex.org/W2131058166","https://openalex.org/W2148105250","https://openalex.org/W2148831787","https://openalex.org/W2159176259","https://openalex.org/W2169369745","https://openalex.org/W2175109984","https://openalex.org/W2238062996","https://openalex.org/W2259421383","https://openalex.org/W2290289666","https://openalex.org/W2531652258","https://openalex.org/W2540136926","https://openalex.org/W2559842622","https://openalex.org/W2560363104","https://openalex.org/W2604146997","https://openalex.org/W2608073799","https://openalex.org/W2611243847","https://openalex.org/W2771232326","https://openalex.org/W2795207876","https://openalex.org/W2887811706","https://openalex.org/W2897711619","https://openalex.org/W2914448900","https://openalex.org/W2963162524","https://openalex.org/W3106480620"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2237480599","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W3032870653","https://openalex.org/W2612665926","https://openalex.org/W4299588719","https://openalex.org/W4294360851","https://openalex.org/W2348504720","https://openalex.org/W2040572217"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}