{"id":"https://openalex.org/W2003846304","doi":"https://doi.org/10.1016/s0305-0548(98)00094-x","title":"An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions","display_name":"An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W2003846304","doi":"https://doi.org/10.1016/s0305-0548(98)00094-x","mag":"2003846304"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(98)00094-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(98)00094-x","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations 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/A5014246362","display_name":"Jo\u00e3o Coutinho\u2010Rodrigues","orcid":"https://orcid.org/0000-0001-9311-5584"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"J.M. Coutinho-Rodrigues","raw_affiliation_strings":["Department of Civil Engineering, F.C.T., University of Coimbra, 3049 Coimbra Codex, Portugal"],"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering, F.C.T., University of Coimbra, 3049 Coimbra Codex, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000951246","display_name":"Jo\u00e3o Cl\u0131\u0301maco","orcid":"https://orcid.org/0000-0001-6655-8590"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"J.C.N. Cl\u0131\u0301maco","raw_affiliation_strings":["Faculty of Economics, University of Coimbra, 3000 Coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"Faculty of Economics, University of Coimbra, 3000 Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055463519","display_name":"John Current","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.R. Current","raw_affiliation_strings":["Department of Management Sciences, The Ohio State University, 1775 College Avenue, Columbus, OH 43210, USA"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, The Ohio State University, 1775 College Avenue, Columbus, OH 43210, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014246362"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":3.2667,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.90503166,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"8","first_page":"789","last_page":"798"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9811999797821045,"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.9811999797821045,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9674999713897705,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7398888468742371},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7160340547561646},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6037641763687134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5857959985733032},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5856962203979492},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5364513993263245},{"id":"https://openalex.org/keywords/decision-maker","display_name":"Decision maker","score":0.5331346988677979},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4729040861129761},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.4474494457244873},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4180063009262085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3208061456680298},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3096247911453247},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.20702692866325378},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12196272611618042},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10285627841949463}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7398888468742371},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7160340547561646},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6037641763687134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5857959985733032},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5856962203979492},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5364513993263245},{"id":"https://openalex.org/C2986080485","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision maker","level":2,"score":0.5331346988677979},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4729040861129761},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.4474494457244873},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4180063009262085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3208061456680298},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3096247911453247},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.20702692866325378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12196272611618042},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10285627841949463},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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/s0305-0548(98)00094-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(98)00094-x","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:estudogeral.sib.uc.pt:10316/4048","is_oa":false,"landing_page_url":"http://hdl.handle.net/10316/4048","pdf_url":null,"source":{"id":"https://openalex.org/S4306401208","display_name":"Estudo Geral (Universidade de Coimbra)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2802025818","host_organization_name":"Hospitais da Universidade de Coimbra","host_organization_lineage":["https://openalex.org/I2802025818"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"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/W616669364","https://openalex.org/W658474192","https://openalex.org/W1483431698","https://openalex.org/W1523334965","https://openalex.org/W1964443412","https://openalex.org/W1970871823","https://openalex.org/W1977927233","https://openalex.org/W1978090048","https://openalex.org/W1979583333","https://openalex.org/W1994909604","https://openalex.org/W1998132337","https://openalex.org/W2005309726","https://openalex.org/W2008593696","https://openalex.org/W2013525683","https://openalex.org/W2025640489","https://openalex.org/W2030169809","https://openalex.org/W2045254727","https://openalex.org/W2051956023","https://openalex.org/W2056802293","https://openalex.org/W2063317962","https://openalex.org/W2063549568","https://openalex.org/W2070409008","https://openalex.org/W2125690626","https://openalex.org/W2144050074","https://openalex.org/W2338905098","https://openalex.org/W4236456142","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2370345607","https://openalex.org/W2388051136","https://openalex.org/W2171039275","https://openalex.org/W2047399896","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W2369626564","https://openalex.org/W2523719706","https://openalex.org/W2198982833","https://openalex.org/W1990043277"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}