{"id":"https://openalex.org/W2006877095","doi":"https://doi.org/10.1016/s0167-6377(03)00026-9","title":"On the directed hop-constrained shortest path problem","display_name":"On the directed hop-constrained shortest path problem","publication_year":2003,"publication_date":"2003-04-23","ids":{"openalex":"https://openalex.org/W2006877095","doi":"https://doi.org/10.1016/s0167-6377(03)00026-9","mag":"2006877095"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(03)00026-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(03)00026-9","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","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/A5045756477","display_name":"Geir Dahl","orcid":"https://orcid.org/0000-0002-7481-6382"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Geir Dahl","raw_affiliation_strings":["Department of Informatics, University of Oslo, P.O. Box 1080 Blindern, 0316 Oslo, Norway","Department of Mathematics, University of Oslo, P.O. Box 1080 Blindern, 0316 Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Oslo, P.O. Box 1080 Blindern, 0316 Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]},{"raw_affiliation_string":"Department of Mathematics, University of Oslo, P.O. Box 1080 Blindern, 0316 Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017238021","display_name":"Lu\u0131\u0301s Gouveia","orcid":"https://orcid.org/0000-0003-4393-1617"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Luis Gouveia","raw_affiliation_strings":["DEIO-CIO, Faculdade de Ci\u00eancias da Universidade de Lisboa, Bloco C/2-Campo Grande, Cidade Universitaria, 1700 Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIO-CIO, Faculdade de Ci\u00eancias da Universidade de Lisboa, Bloco C/2-Campo Grande, Cidade Universitaria, 1700 Lisboa, Portugal","institution_ids":["https://openalex.org/I141596103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017238021"],"corresponding_institution_ids":["https://openalex.org/I141596103"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":6.0851,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.95550725,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"1","first_page":"15","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9927999973297119,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9927999973297119,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9921000003814697,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.939300000667572,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/polytope","display_name":"Polytope","score":0.7585859298706055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7116663455963135},{"id":"https://openalex.org/keywords/isoperimetric-inequality","display_name":"Isoperimetric inequality","score":0.6585677862167358},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6225697994232178},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5895236730575562},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5107250213623047},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.460322767496109},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45294588804244995},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3445231318473816},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31533682346343994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19928395748138428}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7585859298706055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7116663455963135},{"id":"https://openalex.org/C140142295","wikidata":"https://www.wikidata.org/wiki/Q617417","display_name":"Isoperimetric inequality","level":2,"score":0.6585677862167358},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6225697994232178},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5895236730575562},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5107250213623047},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.460322767496109},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45294588804244995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3445231318473816},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31533682346343994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19928395748138428},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0167-6377(03)00026-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(03)00026-9","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W23240032","https://openalex.org/W1963547452","https://openalex.org/W1967079221","https://openalex.org/W1968143987","https://openalex.org/W1989714486","https://openalex.org/W2038806981","https://openalex.org/W2125690626","https://openalex.org/W2138913744","https://openalex.org/W2798566347","https://openalex.org/W4234408051","https://openalex.org/W4298262456"],"related_works":["https://openalex.org/W2393012656","https://openalex.org/W4293733602","https://openalex.org/W2587882711","https://openalex.org/W4387415199","https://openalex.org/W2799900090","https://openalex.org/W4297475888","https://openalex.org/W2042006853","https://openalex.org/W4299574858","https://openalex.org/W2047527454","https://openalex.org/W2051035306"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}