{"id":"https://openalex.org/W3118968546","doi":"https://doi.org/10.1109/cdc42340.2020.9303909","title":"Lasso formulation of the shortest path problem","display_name":"Lasso formulation of the shortest path problem","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3118968546","doi":"https://doi.org/10.1109/cdc42340.2020.9303909","mag":"3118968546"},"language":"en","primary_location":{"id":"doi:10.1109/cdc42340.2020.9303909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5058247970","display_name":"Anqi Dong","orcid":"https://orcid.org/0000-0002-0365-0733"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anqi Dong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035589000","display_name":"Amirhossein Taghvaei","orcid":"https://orcid.org/0000-0002-1536-892X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amirhossein Taghvaei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035194316","display_name":"Tryphon T. Georgiou","orcid":"https://orcid.org/0000-0003-0012-5447"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tryphon T. Georgiou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"402","last_page":"407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9696000218391418,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7573880553245544},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.66165691614151},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.620328962802887},{"id":"https://openalex.org/keywords/lasso","display_name":"Lasso (programming language)","score":0.5933428406715393},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5858314037322998},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5748096704483032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5558322072029114},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4954630136489868},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4877201020717621},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.45122000575065613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44187691807746887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43835312128067017},{"id":"https://openalex.org/keywords/elastic-net-regularization","display_name":"Elastic net regularization","score":0.4290947914123535},{"id":"https://openalex.org/keywords/regression","display_name":"Regression","score":0.3588915765285492},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33592116832733154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26959648728370667},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18638819456100464},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1341487169265747},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09839579463005066}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7573880553245544},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.66165691614151},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.620328962802887},{"id":"https://openalex.org/C37616216","wikidata":"https://www.wikidata.org/wiki/Q3218363","display_name":"Lasso (programming language)","level":2,"score":0.5933428406715393},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5858314037322998},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5748096704483032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5558322072029114},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4954630136489868},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4877201020717621},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.45122000575065613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44187691807746887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43835312128067017},{"id":"https://openalex.org/C203868755","wikidata":"https://www.wikidata.org/wiki/Q5353562","display_name":"Elastic net regularization","level":3,"score":0.4290947914123535},{"id":"https://openalex.org/C83546350","wikidata":"https://www.wikidata.org/wiki/Q1139051","display_name":"Regression","level":2,"score":0.3588915765285492},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33592116832733154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26959648728370667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18638819456100464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1341487169265747},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09839579463005066},{"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/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc42340.2020.9303909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1523888516","display_name":null,"funder_award_id":"FA9550-","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G3089328860","display_name":"EAGER: Real-Time: Search for dynamical dependencies and natural time-scales of physical processes","funder_award_id":"1839441","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G36446433","display_name":null,"funder_award_id":"FA9550-20-1","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G4433416170","display_name":"Collaborative Research: Dynamics of Densities: Modeling, Control and Estimation","funder_award_id":"1807664","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5729145195","display_name":null,"funder_award_id":"FA9550-20","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5809100787","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G7228553140","display_name":null,"funder_award_id":"FA9550-20-1-0029","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W613360614","https://openalex.org/W1597203970","https://openalex.org/W1977545325","https://openalex.org/W2039464620","https://openalex.org/W2063978378","https://openalex.org/W2083277843","https://openalex.org/W2084224084","https://openalex.org/W2090747326","https://openalex.org/W2104317982","https://openalex.org/W2105808107","https://openalex.org/W2135046866","https://openalex.org/W2152204644","https://openalex.org/W2160365857","https://openalex.org/W2164278908","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2625466682","https://openalex.org/W3026832949","https://openalex.org/W3118968546","https://openalex.org/W4213060235","https://openalex.org/W4243449554","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W6739714474","https://openalex.org/W6778057475"],"related_works":["https://openalex.org/W4200172719","https://openalex.org/W2360981904","https://openalex.org/W2375775343","https://openalex.org/W2365712669","https://openalex.org/W2018146256","https://openalex.org/W2377950158","https://openalex.org/W2198982833","https://openalex.org/W2562562750","https://openalex.org/W2156431668","https://openalex.org/W2237480599"],"abstract_inverted_index":{"The":[0],"shortest":[1,28,64],"path":[2,29,44,65],"problem":[3],"is":[4,24],"formulated":[5],"as":[6,16],"an":[7],"l":[8],"<sub":[9],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[10],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[11],"-regularized":[12],"regression":[13,35],"problem,":[14,48],"known":[15],"lasso.":[17],"Based":[18],"on":[19],"this":[20],"formulation,":[21],"a":[22],"connection":[23],"established":[25],"between":[26],"Dijkstra's":[27],"algorithm":[30],"and":[31],"the":[32,38,42,46,52,70],"least":[33],"angle":[34],"(LARS)":[36],"for":[37],"lasso":[39,47],"problem.":[40],"Specifically,":[41],"solution":[43],"of":[45],"obtained":[49],"by":[50],"varying":[51],"regularization":[53,60],"parameter":[54],"from":[55],"infinity":[56],"to":[57,63],"zero":[58],"(the":[59],"path),":[61],"corresponds":[62],"trees":[66],"that":[67],"appear":[68],"in":[69],"bi-directional":[71],"Dijkstra":[72],"algorithm.":[73]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}