{"id":"https://openalex.org/W2804394601","doi":"https://doi.org/10.1007/978-3-319-91479-4_26","title":"Constraint Shortest Path Problem in a Network with Intuitionistic Fuzzy Arc Weights","display_name":"Constraint Shortest Path Problem in a Network with Intuitionistic Fuzzy Arc Weights","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2804394601","doi":"https://doi.org/10.1007/978-3-319-91479-4_26","mag":"2804394601"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-91479-4_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-91479-4_26","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information 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/A5103062523","display_name":"Homayun Motameni","orcid":"https://orcid.org/0000-0003-1309-6569"},"institutions":[{"id":"https://openalex.org/I4210086811","display_name":"Islamic Azad University Sari Branch","ror":"https://ror.org/0032wgp28","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210086811"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Homayun Motameni","raw_affiliation_strings":["Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran","institution_ids":["https://openalex.org/I4210086811"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089713497","display_name":"Ali Ebrahimnejad","orcid":"https://orcid.org/0000-0001-6003-6601"},"institutions":[{"id":"https://openalex.org/I4210138903","display_name":"Qaemshahr Islamic Azad University","ror":"https://ror.org/03y0dv989","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210138903"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ali Ebrahimnejad","raw_affiliation_strings":["Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran"],"raw_orcid":"https://orcid.org/0000-0001-6003-6601","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran","institution_ids":["https://openalex.org/I4210138903"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103062523"],"corresponding_institution_ids":["https://openalex.org/I4210086811"],"apc_list":null,"apc_paid":null,"fwci":1.2625,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80556624,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"310","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9908000230789185,"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/longest-path-problem","display_name":"Longest path problem","score":0.7758345603942871},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6981387138366699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6049036383628845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5745178461074829},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5395599603652954},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5311371684074402},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4484557509422302},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44366705417633057},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44041261076927185},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.41776642203330994},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.38097327947616577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34164923429489136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27423155307769775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21739575266838074},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19281768798828125},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08302804827690125}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7758345603942871},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6981387138366699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6049036383628845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5745178461074829},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5395599603652954},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5311371684074402},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4484557509422302},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44366705417633057},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44041261076927185},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.41776642203330994},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.38097327947616577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34164923429489136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27423155307769775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21739575266838074},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19281768798828125},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08302804827690125},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-91479-4_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-91479-4_26","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information 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":16,"referenced_works":["https://openalex.org/W1694068690","https://openalex.org/W1963895209","https://openalex.org/W1970013289","https://openalex.org/W1971087042","https://openalex.org/W1971921764","https://openalex.org/W1978943789","https://openalex.org/W2007476589","https://openalex.org/W2054743918","https://openalex.org/W2068758895","https://openalex.org/W2073914408","https://openalex.org/W2083103721","https://openalex.org/W2087463697","https://openalex.org/W2106784610","https://openalex.org/W2178025158","https://openalex.org/W2460560651","https://openalex.org/W2551019733"],"related_works":["https://openalex.org/W2388410942","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2022506245","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W2019018557"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}