{"id":"https://openalex.org/W2091120530","doi":"https://doi.org/10.1145/1066677.1066763","title":"A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths","display_name":"A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths","publication_year":2005,"publication_date":"2005-03-13","ids":{"openalex":"https://openalex.org/W2091120530","doi":"https://doi.org/10.1145/1066677.1066763","mag":"2091120530"},"language":"en","primary_location":{"id":"doi:10.1145/1066677.1066763","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066763","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/A5005036369","display_name":"Farid Ajili","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":"Farid Ajili","raw_affiliation_strings":["Imperial College London, London, UK","#N#Imperial College London, London, UK"],"raw_orcid":null,"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":"middle","author":{"id":"https://openalex.org/A5007945151","display_name":"R. Rodo\u0161ek","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":"Robert Rodo\u0161ek","raw_affiliation_strings":["Imperial College London, London, UK","#N#Imperial College London, London, UK"],"raw_orcid":null,"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/A5089660083","display_name":"Andrew Eremin","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":"Andrew Eremin","raw_affiliation_strings":["Imperial College London, London, UK","#N#Imperial College London, London, UK"],"raw_orcid":null,"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":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3693,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84583401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"366","last_page":"370"},"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.9994000196456909,"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.9994000196456909,"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.9994000196456909,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9807000160217285,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7588304877281189},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6194674372673035},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6169193387031555},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5185394883155823},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49052542448043823},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.4796748161315918},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47174084186553955},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"Traffic engineering","score":0.46712902188301086},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46173322200775146},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.45279937982559204},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.4287051558494568},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.41819655895233154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13352054357528687},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.1224258542060852},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12050196528434753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11165636777877808},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10713794827461243}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7588304877281189},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6194674372673035},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6169193387031555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5185394883155823},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49052542448043823},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.4796748161315918},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47174084186553955},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.46712902188301086},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46173322200775146},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45279937982559204},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.4287051558494568},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.41819655895233154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13352054357528687},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.1224258542060852},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12050196528434753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11165636777877808},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10713794827461243},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1066677.1066763","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066763","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":[{"display_name":"Industry, innovation and infrastructure","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1509050436","https://openalex.org/W1516402079","https://openalex.org/W1531550827","https://openalex.org/W1538983961","https://openalex.org/W1603421663","https://openalex.org/W1977545325","https://openalex.org/W1987520910","https://openalex.org/W2068562012","https://openalex.org/W2096655151","https://openalex.org/W2165030634","https://openalex.org/W2171830873","https://openalex.org/W4242272122","https://openalex.org/W6631740608","https://openalex.org/W6635947096","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W2060052838","https://openalex.org/W2893779165","https://openalex.org/W2017432143","https://openalex.org/W1973694374","https://openalex.org/W2983574358","https://openalex.org/W2370475531","https://openalex.org/W2692124420","https://openalex.org/W1995015521","https://openalex.org/W2068859889","https://openalex.org/W2189499199"],"abstract_inverted_index":{"An":[0],"Interior":[1],"Gateway":[2],"Protocol":[3],"(IGP)":[4],"routes":[5,38],"Internet":[6],"end-to-end":[7],"traffic":[8,37],"via":[9],"the":[10,22,32,36,41,47,51,69,73,78,84,90,93,113,147],"shortest":[11,79],"paths":[12,80],"according":[13],"to":[14,21,104,145],"a":[15,56,109,132,157],"set":[16,158],"of":[17,71,156,159],"IGP":[18,48,74],"weights":[19,49,75],"assigned":[20],"network":[23,42,53],"links.":[24],"These":[25],"weights,":[26],"which":[27,101],"can":[28],"be":[29,105],"re-set":[30],"by":[31,63],"administrator,":[33],"uniquely":[34],"determine":[35],"and":[39,45,98,115,140],"thus":[40],"performance.":[43],"Assigning":[44],"provisioning":[46],"incurring":[50],"minimum":[52],"congestion,":[54],"is":[55,131],"common":[57],"practice":[58],"in":[59,83,89,143,153],"Traffic":[60],"Engineering.":[61],"Motivated":[62],"an":[64],"application,":[65],"this":[66],"paper":[67],"considers":[68],"problem":[70,94],"optimizing":[72],"so":[76],"that":[77,117,136],"are":[81,121],"unique":[82],"network.":[85],"Despite":[86],"its":[87],"relevance":[88],"telecoms":[91],"sector,":[92],"poses":[95],"considerable":[96],"modelling":[97],"optimization":[99,126],"challenges":[100],"have":[102],"yet":[103],"addressed.":[106],"We":[107],"develop":[108],"constraint":[110,138],"model":[111,148],"for":[112,124],"problem,":[114],"show":[116],"even":[118],"small":[119],"instances":[120],"too":[122],"difficult":[123],"traditional":[125],"approaches.":[127],"Our":[128,150],"main":[129],"contribution":[130],"new":[133],"hybrid":[134],"optimizer":[135,151],"combines":[137],"programming":[139],"cut/column":[141],"generation":[142],"order":[144],"exploit":[146],"structure.":[149],"succeeds":[152],"solving":[154],"most":[155],"realistically":[160],"sized":[161],"benchmarks.":[162]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}