{"id":"https://openalex.org/W2161704166","doi":"https://doi.org/10.1007/s10288-005-0066-x","title":"The robust shortest path problem with interval data via Benders decomposition","display_name":"The robust shortest path problem with interval data via Benders decomposition","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2161704166","doi":"https://doi.org/10.1007/s10288-005-0066-x","mag":"2161704166"},"language":"en","primary_location":{"id":"doi:10.1007/s10288-005-0066-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-005-0066-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/1176361","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017492288","display_name":"Roberto Montemanni","orcid":"https://orcid.org/0000-0002-0229-0465"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Roberto Montemanni","raw_affiliation_strings":["Istituto Dalle Molle di Studi sull'Intelligenza, Artificiale (IDSIA), Galleria 2, 6928, Lugano-Manno, Switzerland"],"affiliations":[{"raw_affiliation_string":"Istituto Dalle Molle di Studi sull'Intelligenza, Artificiale (IDSIA), Galleria 2, 6928, Lugano-Manno, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109533956","display_name":"Luca Maria Gambardella","orcid":"https://orcid.org/0009-0004-2555-1762"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Luca Maria Gambardella","raw_affiliation_strings":["Istituto Dalle Molle di Studi sull'Intelligenza, Artificiale (IDSIA), Galleria 2, 6928, Lugano-Manno, Switzerland"],"affiliations":[{"raw_affiliation_string":"Istituto Dalle Molle di Studi sull'Intelligenza, Artificiale (IDSIA), Galleria 2, 6928, Lugano-Manno, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017492288"],"corresponding_institution_ids":["https://openalex.org/I2614128279"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.3711,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.92786527,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"3","issue":"4","first_page":"315","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.989300012588501,"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"}},"topics":[{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.989300012588501,"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.9847999811172485,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8548725843429565},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.7355097532272339},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.6356830596923828},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.617951512336731},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6155889630317688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.600204348564148},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5607224702835083},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5551170706748962},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5485395789146423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5050371289253235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4034525454044342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3565562963485718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1647038459777832},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11471772193908691},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07353895902633667}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8548725843429565},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.7355097532272339},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.6356830596923828},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.617951512336731},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6155889630317688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.600204348564148},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5607224702835083},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5551170706748962},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5485395789146423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5050371289253235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4034525454044342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3565562963485718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1647038459777832},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11471772193908691},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07353895902633667},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10288-005-0066-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-005-0066-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.5537","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.5537","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.idsia.ch/~luca/benders.pdf","raw_type":"text"},{"id":"pmh:oai:doc.rero.ch:320360","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400148","display_name":"reroDoc Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:iris.unimore.it:11380/1176361","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1176361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","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/1176361","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1176361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","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":20,"referenced_works":["https://openalex.org/W1579943307","https://openalex.org/W1963888335","https://openalex.org/W1964119857","https://openalex.org/W1966266998","https://openalex.org/W1967113490","https://openalex.org/W1977545325","https://openalex.org/W1984751469","https://openalex.org/W2018638861","https://openalex.org/W2023727736","https://openalex.org/W2028186501","https://openalex.org/W2044121814","https://openalex.org/W2059559546","https://openalex.org/W2061962896","https://openalex.org/W2065163895","https://openalex.org/W2086522200","https://openalex.org/W2103776399","https://openalex.org/W2150889816","https://openalex.org/W2160296554","https://openalex.org/W2169528473","https://openalex.org/W2945904119"],"related_works":["https://openalex.org/W2353519994","https://openalex.org/W2776102956","https://openalex.org/W2384965074","https://openalex.org/W4321491762","https://openalex.org/W2008501342","https://openalex.org/W2367517663","https://openalex.org/W2102269193","https://openalex.org/W1974495461","https://openalex.org/W2386835479","https://openalex.org/W2034881978"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}