{"id":"https://openalex.org/W2022193399","doi":"https://doi.org/10.1016/s0377-2217(02)00594-5","title":"The interactive analysis of the multicriteria shortest path problem by the reference point method","display_name":"The interactive analysis of the multicriteria shortest path problem by the reference point method","publication_year":2003,"publication_date":"2003-01-30","ids":{"openalex":"https://openalex.org/W2022193399","doi":"https://doi.org/10.1016/s0377-2217(02)00594-5","mag":"2022193399"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(02)00594-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(02)00594-5","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","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/A5083157498","display_name":"Janusz Granat","orcid":"https://orcid.org/0000-0003-3130-5555"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I4210125529","display_name":"National Institute of Telecommunications","ror":"https://ror.org/03053v606","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210125529"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Janusz Granat","raw_affiliation_strings":["Institute of Control and Computation Engineering, Warsaw University of Technology, Warsaw and National Institute of Telecommunications, Szachowa 1, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Control and Computation Engineering, Warsaw University of Technology, Warsaw and National Institute of Telecommunications, Szachowa 1, Warsaw, Poland","institution_ids":["https://openalex.org/I4210125529","https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081616385","display_name":"Francesca Guerriero","orcid":"https://orcid.org/0000-0002-3887-1317"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Francesca Guerriero","raw_affiliation_strings":["Dipartimento di Elettronica, Informatica e Sistemistica Via Bucci, Universit\u00e1 della Calabria, Rende (CS) 87030, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Informatica e Sistemistica Via Bucci, Universit\u00e1 della Calabria, Rende (CS) 87030, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081616385"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":3.0773,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.91912394,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"151","issue":"1","first_page":"103","last_page":"118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13181","display_name":"Economic and Technological Systems Analysis","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T13181","display_name":"Economic and Technological Systems Analysis","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14512","display_name":"Technology and Human Factors in Education and Health","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T13732","display_name":"Aerospace, Electronics, Mathematical Modeling","score":0.9794999957084656,"subfield":{"id":"https://openalex.org/subfields/2309","display_name":"Nature and Landscape Conservation"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8168065547943115},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.6750775575637817},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.615312933921814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.579119861125946},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5642638206481934},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5637377500534058},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.506041944026947},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.49436497688293457},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4446040987968445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34195947647094727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33371058106422424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14093729853630066},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06351792812347412}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8168065547943115},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.6750775575637817},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.615312933921814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.579119861125946},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5642638206481934},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5637377500534058},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.506041944026947},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.49436497688293457},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4446040987968445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34195947647094727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33371058106422424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14093729853630066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06351792812347412},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0377-2217(02)00594-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(02)00594-5","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:151:y:2003:i:1:p:103-118","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00594-5","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W1510303234","https://openalex.org/W1600205816","https://openalex.org/W1970166004","https://openalex.org/W1982028039","https://openalex.org/W1998062665","https://openalex.org/W2001579934","https://openalex.org/W2003846304","https://openalex.org/W2008593696","https://openalex.org/W2011039300","https://openalex.org/W2013525683","https://openalex.org/W2018279553","https://openalex.org/W2019016749","https://openalex.org/W2020110101","https://openalex.org/W2024003784","https://openalex.org/W2025640489","https://openalex.org/W2033982221","https://openalex.org/W2036737894","https://openalex.org/W2036850658","https://openalex.org/W2051956023","https://openalex.org/W2056802293","https://openalex.org/W2065693291","https://openalex.org/W2066047491","https://openalex.org/W2068113337","https://openalex.org/W2068665853","https://openalex.org/W2071852134","https://openalex.org/W2082795795","https://openalex.org/W2082907011","https://openalex.org/W2086842401","https://openalex.org/W2089853005","https://openalex.org/W2093807570","https://openalex.org/W2099466544","https://openalex.org/W2133757706","https://openalex.org/W2142240383","https://openalex.org/W2166739719","https://openalex.org/W2802620382","https://openalex.org/W6604902140","https://openalex.org/W6630339979","https://openalex.org/W6653625251","https://openalex.org/W6655394261"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2388410942"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}