{"id":"https://openalex.org/W2974218315","doi":"https://doi.org/10.1007/s10589-019-00132-7","title":"An auction-based approach for the re-optimization shortest path tree problem","display_name":"An auction-based approach for the re-optimization shortest path tree problem","publication_year":2019,"publication_date":"2019-09-21","ids":{"openalex":"https://openalex.org/W2974218315","doi":"https://doi.org/10.1007/s10589-019-00132-7","mag":"2974218315"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-019-00132-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-019-00132-7","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Festa","raw_affiliation_strings":["Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Naples, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"middle","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":"F. Guerriero","raw_affiliation_strings":["Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Cosenza, Italy"],"raw_orcid":"https://orcid.org/0000-0002-3887-1317","affiliations":[{"raw_affiliation_string":"Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Cosenza, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040654178","display_name":"Antonio Napoletano","orcid":null},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Napoletano","raw_affiliation_strings":["Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Naples, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081616385"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.6677,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69229833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"74","issue":"3","first_page":"851","last_page":"893"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7453304529190063},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6614859104156494},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5667878985404968},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5453245043754578},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4590953290462494},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4475199580192566},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43514660000801086},{"id":"https://openalex.org/keywords/auction-algorithm","display_name":"Auction algorithm","score":0.43371444940567017},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29330646991729736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17978975176811218},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16970065236091614},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.1376895010471344},{"id":"https://openalex.org/keywords/auction-theory","display_name":"Auction theory","score":0.10912290215492249},{"id":"https://openalex.org/keywords/revenue-equivalence","display_name":"Revenue equivalence","score":0.10714536905288696}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7453304529190063},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6614859104156494},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5667878985404968},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5453245043754578},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4590953290462494},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4475199580192566},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43514660000801086},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.43371444940567017},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29330646991729736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17978975176811218},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16970065236091614},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.1376895010471344},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.10912290215492249},{"id":"https://openalex.org/C143684077","wikidata":"https://www.wikidata.org/wiki/Q431186","display_name":"Revenue equivalence","level":4,"score":0.10714536905288696},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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.1007/s10589-019-00132-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-019-00132-7","pdf_url":null,"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":null,"license_id":null,"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:74:y:2019:i:3:d:10.1007_s10589-019-00132-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-019-00132-7","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W835219510","https://openalex.org/W1511571834","https://openalex.org/W1568032077","https://openalex.org/W1604310870","https://openalex.org/W1952568655","https://openalex.org/W1977545325","https://openalex.org/W1978757752","https://openalex.org/W1982809790","https://openalex.org/W1984057027","https://openalex.org/W1990043277","https://openalex.org/W1995415305","https://openalex.org/W2001560396","https://openalex.org/W2010915164","https://openalex.org/W2015648019","https://openalex.org/W2022193399","https://openalex.org/W2027119735","https://openalex.org/W2029706450","https://openalex.org/W2037963614","https://openalex.org/W2048815087","https://openalex.org/W2053697731","https://openalex.org/W2063896698","https://openalex.org/W2074609999","https://openalex.org/W2079274727","https://openalex.org/W2083537714","https://openalex.org/W2089853005","https://openalex.org/W2099144379","https://openalex.org/W2112964526","https://openalex.org/W2113256452","https://openalex.org/W2115106512","https://openalex.org/W2115847261","https://openalex.org/W2119312244","https://openalex.org/W2119991623","https://openalex.org/W2139290948","https://openalex.org/W2142547441","https://openalex.org/W2159046795","https://openalex.org/W2169528473","https://openalex.org/W2171985270","https://openalex.org/W2251882317","https://openalex.org/W2336786694","https://openalex.org/W2594045304","https://openalex.org/W2609578772","https://openalex.org/W2614223016","https://openalex.org/W2794328882","https://openalex.org/W2949082236","https://openalex.org/W3137299218","https://openalex.org/W4252801674","https://openalex.org/W6600707886"],"related_works":["https://openalex.org/W2353519994","https://openalex.org/W2386835479","https://openalex.org/W2469944050","https://openalex.org/W2066371783","https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W4229964315","https://openalex.org/W2966049562","https://openalex.org/W143035870","https://openalex.org/W2134492883"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}