{"id":"https://openalex.org/W2062404037","doi":"https://doi.org/10.1145/1066677.1066766","title":"Hybrid Lagrangian relaxation for bandwidth-constrained routing","display_name":"Hybrid Lagrangian relaxation for bandwidth-constrained routing","publication_year":2005,"publication_date":"2005-03-13","ids":{"openalex":"https://openalex.org/W2062404037","doi":"https://doi.org/10.1145/1066677.1066766","mag":"2062404037"},"language":"en","primary_location":{"id":"doi:10.1145/1066677.1066766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-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/A5028285683","display_name":"Wided Ouaja","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Wided Ouaja","raw_affiliation_strings":["Imperial College London, London, UK","#N#Imperial College London, London, UK"],"affiliations":[{"raw_affiliation_string":"Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"#N#Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113436040","display_name":"Barry Richards","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Barry Richards","raw_affiliation_strings":["Imperial College London, London, UK","#N#Imperial College London, London, UK"],"affiliations":[{"raw_affiliation_string":"Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"#N#Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028285683"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":1.4227,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82430332,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"383","last_page":"387"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9894000291824341,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9894000291824341,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9749000072479248,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7232638597488403},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7169857621192932},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6140353679656982},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.608466386795044},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6070823073387146},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.562332808971405},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4820314645767212},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4784272313117981},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4730345904827118},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4405120313167572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26590412855148315},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15087133646011353}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7232638597488403},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7169857621192932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6140353679656982},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.608466386795044},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6070823073387146},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.562332808971405},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4820314645767212},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4784272313117981},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4730345904827118},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4405120313167572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26590412855148315},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15087133646011353},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1066677.1066766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W182522459","https://openalex.org/W1498462448","https://openalex.org/W1879950603","https://openalex.org/W1911069185","https://openalex.org/W1977545325","https://openalex.org/W2068562012","https://openalex.org/W2114525688","https://openalex.org/W2171830873","https://openalex.org/W4242272122","https://openalex.org/W4285719527","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W623642078","https://openalex.org/W3125085490"],"abstract_inverted_index":{"To":[0,58],"deliver":[1],"quality":[2],"of":[3,17,27,86,124,131,154,170],"service,":[4],"internet":[5],"service":[6],"providers":[7],"are":[8],"seeking":[9],"effective":[10],"solutions":[11],"to":[12,22,55,93,127,173],"optimize":[13],"their":[14,37],"networks.":[15],"One":[16],"the":[18,82,87,117,128,132,156,168],"main":[19],"tasks":[20],"is":[21,46,53,176],"optimally":[23],"route":[24],"a":[25,32,63,122],"set":[26],"traffic":[28],"demands,":[29],"each":[30],"along":[31],"single":[33],"path,":[34],"while":[35],"satisfying":[36],"bandwidth":[38],"requirements":[39],"and":[40,66,74,89,104,164],"without":[41],"exceeding":[42],"edge":[43],"capacities.":[44],"This":[45],"an":[47,113,151],"integer":[48],"multicommodity":[49],"flow":[50],"problem,":[51],"which":[52],"known":[54],"be":[56],"NP-hard.":[57],"solve":[59],"this":[60,109,135],"problem":[61,88],"efficiently,":[62],"new":[64],"complete":[65],"scalable":[67],"hybrid":[68],"solver":[69],"(HLR)":[70],"integrating":[71],"Lagrangian":[72],"relaxation":[73,136],"constraint":[75],"programming":[76],"has":[77,90,145],"been":[78,91],"proposed.":[79],"It":[80],"exploits":[81],"shortest":[83],"path":[84],"decomposition":[85,130],"shown":[92],"yield":[94],"significant":[95],"benefits":[96,157],"over":[97],"several":[98],"other":[99],"algorithms,":[100],"such":[101],"as":[102],"CPLEX":[103],"well-known":[105],"routing":[106],"heuristics.":[107],"In":[108],"paper":[110,149],"we":[111],"explore":[112],"alternative":[114],"dualization":[115],"within":[116],"same":[118],"hybrid.":[119],"We":[120],"present":[121],"variant":[123],"HLR,":[125],"adapted":[126],"knapsack":[129],"problem.":[133],"Although":[134],"seems":[137],"less":[138],"natural,":[139],"experimental":[140],"results":[141],"show":[142],"that":[143],"it":[144],"some":[146],"advantages.":[147],"The":[148],"provides":[150],"interesting":[152],"insight":[153],"where":[155,167],"may":[158],"lie,":[159],"in":[160],"particular":[161],"for":[162],"larger":[163],"harder":[165],"cases":[166],"ratio":[169],"total":[171],"demand":[172],"available":[174],"capacity":[175],"higher.":[177]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}