{"id":"https://openalex.org/W4292571915","doi":"https://doi.org/10.1007/s10589-022-00403-w","title":"Shortest path with acceleration constraints: complexity and approximation algorithms","display_name":"Shortest path with acceleration constraints: complexity and approximation algorithms","publication_year":2022,"publication_date":"2022-08-10","ids":{"openalex":"https://openalex.org/W4292571915","doi":"https://doi.org/10.1007/s10589-022-00403-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-022-00403-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-022-00403-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00403-w.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00403-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073881613","display_name":"Stefano Ardizzoni","orcid":"https://orcid.org/0000-0003-1426-0834"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"S. Ardizzoni","raw_affiliation_strings":["Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048869539","display_name":"Luca Consolini","orcid":"https://orcid.org/0000-0002-3577-9398"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Consolini","raw_affiliation_strings":["Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025409316","display_name":"Mattia Laurini","orcid":"https://orcid.org/0000-0001-9965-8803"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Laurini","raw_affiliation_strings":["Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050902529","display_name":"Marco Locatelli","orcid":"https://orcid.org/0000-0001-7138-8653"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"M. Locatelli","raw_affiliation_strings":["Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy"],"raw_orcid":"https://orcid.org/0000-0001-7138-8653","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Architettura, Universit\u00e0 degli Studi di Parma, Parco Area delle Scienze, 181/A, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050902529"],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.081,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.32775775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"83","issue":"2","first_page":"555","last_page":"592"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"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/T11106","display_name":"Data Management and Algorithms","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.7577593922615051},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6060062646865845},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5975943207740784},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.597417950630188},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5925003290176392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5766134262084961},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5665708184242249},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5630361437797546},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5199633836746216},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5024070739746094},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49866223335266113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36261117458343506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30188336968421936},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26308193802833557},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13887056708335876},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13435575366020203},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08959010243415833}],"concepts":[{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.7577593922615051},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6060062646865845},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5975943207740784},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.597417950630188},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5925003290176392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5766134262084961},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5665708184242249},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5630361437797546},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5199633836746216},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5024070739746094},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49866223335266113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36261117458343506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30188336968421936},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26308193802833557},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13887056708335876},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13435575366020203},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08959010243415833},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10589-022-00403-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-022-00403-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00403-w.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:coopap:v:83:y:2022:i:2:d:10.1007_s10589-022-00403-w","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-022-00403-w","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":{"id":"doi:10.1007/s10589-022-00403-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-022-00403-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-022-00403-w.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322875","display_name":"Universit\u00e0 degli Studi di Parma","ror":"https://ror.org/02k7wn190"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4292571915.pdf","grobid_xml":"https://content.openalex.org/works/W4292571915.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1576264942","https://openalex.org/W1964443412","https://openalex.org/W1975226165","https://openalex.org/W2011039300","https://openalex.org/W2040572217","https://openalex.org/W2053697731","https://openalex.org/W2089338760","https://openalex.org/W2091020754","https://openalex.org/W2133228819","https://openalex.org/W2144050074","https://openalex.org/W2156117830","https://openalex.org/W2168550231","https://openalex.org/W2604921123","https://openalex.org/W2890473921","https://openalex.org/W2936511596","https://openalex.org/W2995689593","https://openalex.org/W3093293420","https://openalex.org/W4205775998","https://openalex.org/W4285129093"],"related_works":["https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W2978447330","https://openalex.org/W2134492883","https://openalex.org/W4386289885","https://openalex.org/W2944624729","https://openalex.org/W2388813193","https://openalex.org/W2354605212","https://openalex.org/W2370465935","https://openalex.org/W2067366661"],"abstract_inverted_index":{"Abstract":[0],"We":[1,79,88],"introduce":[2],"a":[3,38,48,60,101],"variant":[4,31],"of":[5,83,119,126,146],"the":[6,18,21,71,75,81,98,117,120,124,127,144,147],"Shortest":[7],"Path":[8],"Problem":[9],"(SPP),":[10],"in":[11,51],"which":[12],"we":[13,106,137],"impose":[14],"additional":[15,93],"constraints":[16,68],"on":[17,70,95],"acceleration":[19,67],"over":[20],"arcs,":[22],"and":[23,66,123],"call":[24],"it":[25],"Bounded":[26],"Acceleration":[27],"SPP":[28],"(BASP).":[29],"This":[30],"is":[32],"inspired":[33],"by":[34],"an":[35,108],"industrial":[36],"application:":[37],"vehicle":[39,72],"needs":[40],"to":[41,47,116,142],"travel":[42],"from":[43],"its":[44,86],"current":[45],"position":[46,73],"target":[49],"one":[50],"minimum-time,":[52],"following":[53],"pre-defined":[54],"geometric":[55],"paths":[56],"connecting":[57],"positions":[58],"within":[59],"facility,":[61],"while":[62],"satisfying":[63],"some":[64,139],"speed":[65],"depending":[69],"along":[74],"currently":[76],"traveled":[77],"path.":[78],"characterize":[80],"complexity":[82],"BASP,":[84],"proving":[85],"NP-hardness.":[87],"also":[89],"show":[90],"that,":[91],"under":[92],"hypotheses":[94],"problem":[96,99,122],"data,":[97],"admits":[100],"pseudo-polynomial":[102],"time-complexity":[103,113],"algorithm.":[104,150],"Moreover,":[105],"present":[107,138],"approximation":[109,128,149],"algorithm":[110],"with":[111,114],"polynomial":[112],"respect":[115],"data":[118],"original":[121],"inverse":[125],"factor":[129],"$$\\epsilon$$":[130],"<mml:math":[131],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[132],"<mml:mi>\u03f5</mml:mi>":[133],"</mml:math>":[134],".":[135],"Finally,":[136],"computational":[140],"experiments":[141],"evaluate":[143],"performance":[145],"proposed":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}