{"id":"https://openalex.org/W1980349963","doi":"https://doi.org/10.1109/tc.2014.2366762","title":"Finding Multi-Constrained Multiple Shortest Paths","display_name":"Finding Multi-Constrained Multiple Shortest Paths","publication_year":2014,"publication_date":"2014-11-03","ids":{"openalex":"https://openalex.org/W1980349963","doi":"https://doi.org/10.1109/tc.2014.2366762","mag":"1980349963"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2014.2366762","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2014.2366762","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5082124101","display_name":"Gang Feng","orcid":"https://orcid.org/0000-0001-8508-8416"},"institutions":[{"id":"https://openalex.org/I1745920","display_name":"University of Wisconsin\u2013Platteville","ror":"https://ror.org/02xpkhc07","country_code":"US","type":"education","lineage":["https://openalex.org/I1745920"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gang Feng","raw_affiliation_strings":["Electrical Engineering Department, University of Wisconsin, Platteville, WI"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, University of Wisconsin, Platteville, WI","institution_ids":["https://openalex.org/I1745920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011209223","display_name":"Turgay Korkmaz","orcid":"https://orcid.org/0000-0002-5529-673X"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Turgay Korkmaz","raw_affiliation_strings":["Department of Computer Science, University of Texas at San Antonio, San Antonio, TX","Dept. of Computer Science, University of Texas at San Antonio, San Antonio, TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at San Antonio, San Antonio, TX","institution_ids":["https://openalex.org/I45438204"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Texas at San Antonio, San Antonio, TX#TAB#","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082124101"],"corresponding_institution_ids":["https://openalex.org/I1745920"],"apc_list":null,"apc_paid":null,"fwci":0.5823,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.64855324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"64","issue":"9","first_page":"2559","last_page":"2572"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"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.9975000023841858,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9958000183105469,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9825000166893005,"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.7792028784751892},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6733531951904297},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6659867763519287},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6102182269096375},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.6039183735847473},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5960733890533447},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5672550201416016},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5388690233230591},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5342907309532166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5116432309150696},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4964759945869446},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47753679752349854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4407275915145874},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43514472246170044},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.22646036744117737},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18083417415618896},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11360591650009155}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7792028784751892},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6733531951904297},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6659867763519287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6102182269096375},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.6039183735847473},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5960733890533447},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5672550201416016},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5388690233230591},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5342907309532166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5116432309150696},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4964759945869446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47753679752349854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4407275915145874},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43514472246170044},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.22646036744117737},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18083417415618896},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11360591650009155},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2014.2366762","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2014.2366762","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1547227531","https://openalex.org/W1963547452","https://openalex.org/W1964443412","https://openalex.org/W1969483458","https://openalex.org/W1977545325","https://openalex.org/W1981162332","https://openalex.org/W1995415305","https://openalex.org/W2006543170","https://openalex.org/W2011039300","https://openalex.org/W2011282943","https://openalex.org/W2024060531","https://openalex.org/W2036900823","https://openalex.org/W2049733312","https://openalex.org/W2056413289","https://openalex.org/W2060194699","https://openalex.org/W2069667928","https://openalex.org/W2073296515","https://openalex.org/W2089631446","https://openalex.org/W2094099891","https://openalex.org/W2098074159","https://openalex.org/W2101089925","https://openalex.org/W2101234060","https://openalex.org/W2106784610","https://openalex.org/W2106841911","https://openalex.org/W2114686820","https://openalex.org/W2116466881","https://openalex.org/W2119775299","https://openalex.org/W2130679277","https://openalex.org/W2131058166","https://openalex.org/W2140556610","https://openalex.org/W2160658249","https://openalex.org/W2169369745","https://openalex.org/W2325602005","https://openalex.org/W2408262133","https://openalex.org/W3145128584","https://openalex.org/W4213060235","https://openalex.org/W4233558979","https://openalex.org/W4246153096","https://openalex.org/W4246219036","https://openalex.org/W4250598149","https://openalex.org/W6632804665","https://openalex.org/W6675250796"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W4293054712","https://openalex.org/W2368964068","https://openalex.org/W2198982833","https://openalex.org/W2161960576","https://openalex.org/W2358094779","https://openalex.org/W2366342492","https://openalex.org/W2030169809","https://openalex.org/W2597144308"],"abstract_inverted_index":{"Numerous":[0],"algorithms":[1],"have":[2,16],"been":[3],"proposed":[4],"for":[5,49,107],"the":[6,43,66,76,89,92,103,150,185,190],"well-known":[7],"multi-constrained":[8],"shortest":[9,51],"path":[10,80,109,142],"(MCSP)":[11],"problem,":[12],"but":[13],"very":[14],"few":[15],"good":[17],"practical":[18],"performance":[19],"in":[20,58,189],"case":[21],"of":[22,42,126,166,180],"two":[23,178],"or":[24,177],"more":[25],"constraints.":[26,56],"In":[27],"this":[28],"paper,":[29],"we":[30,47,155],"propose":[31],"a":[32,39,79,121,134,162],"new":[33],"Lagrangian":[34],"relaxation":[35],"algorithm":[36,63,85,138,159,188],"to":[37,54,74,123,139,168],"solve":[38,161],"generalized":[40],"version":[41],"MCSP":[44],"problem":[45],"where":[46],"search":[48,105],"multiple":[50,55],"paths":[52,137],"subject":[53],"As":[57],"some":[59],"related":[60],"work,":[61],"our":[62,84,158],"first":[64],"identifies":[65],"lower":[67,117],"and":[68,71,129],"upper":[69],"bounds,":[70],"then":[72],"tries":[73],"close":[75],"gap":[77],"with":[78,170,184],"enumeration":[81],"procedure.":[82],"However,":[83],"is":[86],"based":[87],"on":[88,146],"recognition":[90],"that":[91,157],"Lagrange":[93],"multipliers":[94],"found":[95],"by":[96,175],"existing":[97],"methods":[98],"usually":[99],"do":[100],"not":[101],"give":[102],"best":[104,186],"direction":[106],"minimizing":[108],"enumerations":[110],"even":[111],"though":[112],"they":[113],"can":[114,160],"provide":[115,120],"near-optimized":[116],"bounds.":[118],"We":[119],"solution":[122],"meet":[124],"both":[125],"these":[127],"goals,":[128],"incorporate":[130],"feasibility":[131],"checks":[132],"into":[133],"state-of-the-art":[135],"K-shortest":[136],"further":[140],"reduce":[141],"enumerations.":[143],"Through":[144],"experiments":[145],"various":[147],"networks":[148],"including":[149],"most":[151],"challenging":[152],"benchmark":[153],"instances,":[154],"show":[156],"significantly":[163],"larger":[164],"number":[165],"instances":[167],"optimality":[169],"less":[171],"computational":[172],"cost,":[173],"often":[174],"one":[176],"orders":[179],"magnitude,":[181],"when":[182],"compared":[183],"known":[187],"literature.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}