{"id":"https://openalex.org/W2996176795","doi":"https://doi.org/10.1109/tnet.2019.2955451","title":"Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem","display_name":"Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem","publication_year":2019,"publication_date":"2019-12-17","ids":{"openalex":"https://openalex.org/W2996176795","doi":"https://doi.org/10.1109/tnet.2019.2955451","mag":"2996176795"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2019.2955451","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2955451","pdf_url":"https://ieeexplore.ieee.org/ielx7/90/8999818/08935448.pdf","source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ieeexplore.ieee.org/ielx7/90/8999818/08935448.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085855119","display_name":"Caixia Kou","orcid":"https://orcid.org/0000-0001-8945-8613"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Caixia Kou","raw_affiliation_strings":["School of Sciences, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0001-8945-8613","affiliations":[{"raw_affiliation_string":"School of Sciences, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045348113","display_name":"Dedong Hu","orcid":"https://orcid.org/0000-0002-0834-6511"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dedong Hu","raw_affiliation_strings":["School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012750258","display_name":"Jianhua Yuan","orcid":"https://orcid.org/0000-0003-2277-1298"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianhua Yuan","raw_affiliation_strings":["School of Sciences, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0003-2277-1298","affiliations":[{"raw_affiliation_string":"School of Sciences, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012183764","display_name":"Wenbao Ai","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenbao Ai","raw_affiliation_strings":["School of Sciences, Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Sciences, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5085855119"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.7433,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75822589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"28","issue":"1","first_page":"224","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7527139186859131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5893681049346924},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5846285820007324},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5471704006195068},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5235438346862793},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5089583396911621},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.47743353247642517},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46552011370658875},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4375638961791992},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.436741441488266},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42746207118034363},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.41830819845199585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33133143186569214},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18780788779258728},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0797569751739502}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7527139186859131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5893681049346924},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5846285820007324},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5471704006195068},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5235438346862793},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5089583396911621},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.47743353247642517},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46552011370658875},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4375638961791992},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.436741441488266},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42746207118034363},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.41830819845199585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33133143186569214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18780788779258728},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0797569751739502},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2019.2955451","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2955451","pdf_url":"https://ieeexplore.ieee.org/ielx7/90/8999818/08935448.pdf","source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1109/tnet.2019.2955451","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2955451","pdf_url":"https://ieeexplore.ieee.org/ielx7/90/8999818/08935448.pdf","source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G344789028","display_name":null,"funder_award_id":"11871115","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6241444493","display_name":null,"funder_award_id":"11671052","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6521789126","display_name":null,"funder_award_id":"11971073","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7009817178","display_name":null,"funder_award_id":"91630202","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8463962830","display_name":null,"funder_award_id":"91630202","funder_id":"https://openalex.org/F4320335577","funder_display_name":"Major Research Plan"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335577","display_name":"Major Research Plan","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2996176795.pdf","grobid_xml":"https://content.openalex.org/works/W2996176795.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1498798861","https://openalex.org/W1538552935","https://openalex.org/W1573144638","https://openalex.org/W1871367359","https://openalex.org/W1964443412","https://openalex.org/W1969675191","https://openalex.org/W1995415305","https://openalex.org/W2011039300","https://openalex.org/W2011282943","https://openalex.org/W2036900823","https://openalex.org/W2038129566","https://openalex.org/W2069667928","https://openalex.org/W2106784610","https://openalex.org/W2106841911","https://openalex.org/W2114686820","https://openalex.org/W2115319629","https://openalex.org/W2123562836","https://openalex.org/W2127456145","https://openalex.org/W2130626677","https://openalex.org/W2131058166","https://openalex.org/W2140556610","https://openalex.org/W2144806816","https://openalex.org/W2148836938","https://openalex.org/W2169369745","https://openalex.org/W2169528473","https://openalex.org/W2914162397","https://openalex.org/W4246153096","https://openalex.org/W4247951747","https://openalex.org/W6629880394","https://openalex.org/W6632150083","https://openalex.org/W6660309402"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W3183360588","https://openalex.org/W2375280931","https://openalex.org/W2352589493","https://openalex.org/W2391048224","https://openalex.org/W2387829241","https://openalex.org/W2395868876","https://openalex.org/W2978166001","https://openalex.org/W3200343262"],"abstract_inverted_index":{"We":[0],"propose":[1],"two":[2],"new":[3],"algorithms":[4],"called":[5],"BiLAD":[6,74,141],"and":[7],"ExactBiLAD":[8,212,240],"for":[9],"the":[10,33,61,65,80,96,108,115,119,138,157,162,169,173,177,193,201,220,226,230,246],"well-known":[11],"Single-Constrained":[12],"Shortest":[13],"Path":[14],"(SCSP)":[15],"problem.":[16],"It":[17],"is":[18,52,68,75,87,114,123,142,156,196],"a":[19,29,37,42,92,215,242],"fundamental":[20],"problem":[21,63,67,195],"in":[22,41,125,132,187,245],"quality-of-service":[23],"(QoS)":[24],"routing,":[25],"where":[26],"one":[27],"seeks":[28],"source-destination":[30],"path":[31],"with":[32,57],"least":[34,90],"cost":[35],"satisfying":[36],"delay":[38],"QoS":[39,134],"constraint":[40],"network.":[43],"As":[44],"pointed":[45],"out":[46],"by":[47,180,199],"J\u00fcttner":[48],"et":[49],"al.,":[50],"there":[51],"no":[53],"widely":[54],"accepted":[55],"algorithm":[56,223],"polynomial":[58,104,120],"time":[59,105,117,121],"to":[60,144,192],"SCSP":[62,66,194],"because":[64],"NP-hard.":[69],"The":[70,127,149,207],"remarkable":[71],"feature":[72],"of":[73,82,98,110,140,161,172,218,225],"that":[76,79,118,160,211],"it":[77],"ensures":[78],"length":[81],"iteratively":[83],"updated":[84],"angle":[85],"interval":[86],"shrunk":[88],"at":[89,91],"constant":[93],"ratio.":[94],"With":[95],"help":[97],"this":[99,113],"feature,":[100],"we":[101,182],"prove":[102],"its":[103],"complexity.":[106],"To":[107],"best":[109],"our":[111],"knowledge,":[112],"first":[116],"complexity":[122,155],"proved":[124],"details.":[126],"numerical":[128],"results":[129,209],"show":[130],"that,":[131],"most":[133],"routing":[135],"test":[136],"instances,":[137],"performance":[139,244],"close":[143],"their":[145],"primal":[146],"optimal":[147,190],"solutions.":[148],"proposed":[150],"modified":[151,221],"Dijkstra":[152,163,222],"procedure,":[153],"whose":[154],"same":[158],"as":[159],"algorithm,":[164],"also":[165],"accelerates":[166],"BiLAD.":[167],"In":[168],"second":[170],"part":[171],"paper,":[174],"based":[175],"on":[176],"information":[178],"obtained":[179,198],"BiLAD,":[181],"design":[183],"an":[184,189],"exact":[185,238],"algorithm-ExactBiLAD,":[186],"which":[188],"solution":[191],"finally":[197],"scanning":[200],"steadily":[202],"reduced":[203],"optimal-path-candidate":[204],"triangle":[205],"area.":[206],"simulation":[208],"indicate":[210],"needs":[213],"only":[214],"dozen":[216],"times":[217],"executing":[219],"regardless":[224],"network":[227],"size":[228],"or":[229],"average":[231],"node":[232],"degree.":[233],"Distinguished":[234],"from":[235],"many":[236],"other":[237],"algorithms,":[239],"has":[241],"satisfactory":[243],"practical":[247],"computation.":[248]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}