{"id":"https://openalex.org/W2087488624","doi":"https://doi.org/10.1137/s1052623498343477","title":"Auction Algorithms for Shortest Hyperpath Problems","display_name":"Auction Algorithms for Shortest Hyperpath Problems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2087488624","doi":"https://doi.org/10.1137/s1052623498343477","mag":"2087488624"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623498343477","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498343477","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/585397","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049314822","display_name":"Renato De Leone","orcid":"https://orcid.org/0000-0001-9783-608X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. De Leone","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070031423","display_name":"Daniele Pretolani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Pretolani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049314822"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2054,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90608067,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"149","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9991000294685364,"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/T11182","display_name":"Auction Theory and Applications","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7503316402435303},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6216108798980713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5992146730422974},{"id":"https://openalex.org/keywords/auction-algorithm","display_name":"Auction algorithm","score":0.5733203291893005},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5652162432670593},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4860294461250305},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.44372260570526123},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4369127154350281},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37147679924964905},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3330109715461731},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1551494598388672},{"id":"https://openalex.org/keywords/auction-theory","display_name":"Auction theory","score":0.14391204714775085},{"id":"https://openalex.org/keywords/revenue-equivalence","display_name":"Revenue equivalence","score":0.14143607020378113},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.11083140969276428}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7503316402435303},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6216108798980713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5992146730422974},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.5733203291893005},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5652162432670593},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4860294461250305},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.44372260570526123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4369127154350281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37147679924964905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3330109715461731},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1551494598388672},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.14391204714775085},{"id":"https://openalex.org/C143684077","wikidata":"https://www.wikidata.org/wiki/Q431186","display_name":"Revenue equivalence","level":4,"score":0.14143607020378113},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.11083140969276428},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623498343477","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498343477","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.6911","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.6911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.unicam.it/~deleone/Links/tr/tr1998_01.ps","raw_type":"text"},{"id":"pmh:oai:iris.unimore.it:11380/585397","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/585397","pdf_url":null,"source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/585397","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/585397","pdf_url":null,"source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W9296126","https://openalex.org/W834602582","https://openalex.org/W1546862091","https://openalex.org/W1592598294","https://openalex.org/W1964486323","https://openalex.org/W2009070933","https://openalex.org/W2044973895","https://openalex.org/W2047197934","https://openalex.org/W2060416492","https://openalex.org/W2060772802","https://openalex.org/W2065002018","https://openalex.org/W2069861393","https://openalex.org/W2083537714","https://openalex.org/W2084186193","https://openalex.org/W2112660220","https://openalex.org/W2119312244","https://openalex.org/W2119991623","https://openalex.org/W2137684376","https://openalex.org/W2614223016","https://openalex.org/W4240251632","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2388654557","https://openalex.org/W2767202586","https://openalex.org/W2161960576","https://openalex.org/W2030169809","https://openalex.org/W4307561361","https://openalex.org/W2366342492"],"abstract_inverted_index":{"The":[0,35],"auction-reduction":[1,23,44],"algorithm":[2,24],"is":[3,46],"a":[4],"strongly":[5],"polynomial":[6],"version":[7],"of":[8,28,37,55],"the":[9,13,22,43],"auction":[10],"method":[11,45],"for":[12,52],"shortest":[14,29],"path":[15],"problem.":[16],"In":[17],"this":[18],"paper":[19],"we":[20],"extend":[21],"to":[25,48],"different":[26],"types":[27],"hyperpath":[30],"problems":[31],"in":[32],"directed":[33],"hypergraphs.":[34,56],"results":[36],"preliminary":[38],"computational":[39],"experiences":[40],"show":[41],"that":[42],"comparable":[47],"other":[49],"known":[50],"methods":[51],"specific":[53],"classes":[54]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}