{"id":"https://openalex.org/W7214901561","doi":"https://doi.org/10.48550/arxiv.2609.36338","title":"Lexicographic Minimax Load Balancing for T-Adaptive Segment Routing","display_name":"Lexicographic Minimax Load Balancing for T-Adaptive Segment Routing","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214901561","doi":"https://doi.org/10.48550/arxiv.2609.36338"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.36338","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36338","pdf_url":"https://arxiv.org/pdf/2609.36338","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.36338","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126571177","display_name":"Kaoutar Bouaachra","orcid":"https://orcid.org/0009-0002-2453-662X","observed_orcids":["https://orcid.org/0009-0002-2453-662X"]},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210145102","display_name":"Institut Polytechnique de Paris","ror":"https://ror.org/042tfbd02","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bouaachra, Kaoutar","raw_affiliation_strings":["\u00c9cole polytechnique , Institut Polytechnique de Paris Internship report Host organization Orange Research , Data & AI Division , MORE team Industry supervisor Yannick Carlinet Context ROADEF / EURO Challenge"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole polytechnique , Institut Polytechnique de Paris Internship report Host organization Orange Research , Data & AI Division , MORE team Industry supervisor Yannick Carlinet Context ROADEF / EURO Challenge","institution_ids":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5126571177"],"corresponding_institution_ids":["https://openalex.org/I142476485","https://openalex.org/I4210145102"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.365200012922287,"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.365200012922287,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.25850000977516174,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.1468999981880188,"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/segment-routing","display_name":"segment routing","score":0.9369999766349792},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"traffic engineering","score":0.7419999837875366},{"id":"https://openalex.org/keywords/ip-mpls-networks","display_name":"IP/MPLS","score":0.7070000171661377},{"id":"https://openalex.org/keywords/planned-maintenance","display_name":"planned maintenance","score":0.7590000033378601},{"id":"https://openalex.org/keywords/multi-period-optimization","display_name":"multi-period optimization","score":0.7289999723434448},{"id":"https://openalex.org/keywords/lexicographic-optimization","display_name":"lexicographic optimization","score":0.8259999752044678},{"id":"https://openalex.org/keywords/link-load-balancing","display_name":"link load balancing","score":0.8399999737739563},{"id":"https://openalex.org/keywords/path-reconfiguration","display_name":"path reconfiguration","score":0.7630000114440918},{"id":"https://openalex.org/keywords/column-generation","display_name":"column generation","score":0.6779999732971191},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"branch-and-price","score":0.9100000262260437},{"id":"https://openalex.org/keywords/network-resource-utilization","display_name":"network resource utilization","score":0.37299999594688416}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.800000011920929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7078999876976013},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6424000263214111},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4790000021457672},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.46720001101493835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45210000872612},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4440999925136566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4293999969959259},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4278999865055084},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3675999939441681},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3357999920845032},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C2780757406","wikidata":"https://www.wikidata.org/wiki/Q465837","display_name":"Skyline","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.30649998784065247},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.3043000102043152},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.29260000586509705},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.36338","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36338","pdf_url":"https://arxiv.org/pdf/2609.36338","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.36338","doi":"https://doi.org/10.48550/arxiv.2609.36338","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.36338","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.36338","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36338","pdf_url":"https://arxiv.org/pdf/2609.36338","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.8970999717712402}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214901561.pdf","grobid_xml":"https://content.openalex.org/works/W7214901561.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1545430305","https://openalex.org/W1834040419","https://openalex.org/W1991050105","https://openalex.org/W1999895824","https://openalex.org/W2013479503","https://openalex.org/W2022769849","https://openalex.org/W2105560970","https://openalex.org/W2106479615","https://openalex.org/W2149335048","https://openalex.org/W2150338193","https://openalex.org/W2167580124","https://openalex.org/W2762773307","https://openalex.org/W2919775137","https://openalex.org/W3023420356","https://openalex.org/W3093763822","https://openalex.org/W3215863231","https://openalex.org/W4385233802","https://openalex.org/W4396648989","https://openalex.org/W7140327284"],"related_works":["https://openalex.org/W7214740686","https://openalex.org/W7220724531","https://openalex.org/W2962271942","https://openalex.org/W3034292819","https://openalex.org/W6996369095","https://openalex.org/W4401610463","https://openalex.org/W2984351374","https://openalex.org/W4385233802","https://openalex.org/W4212846760","https://openalex.org/W4409351511"],"abstract_inverted_index":{"We":[0,126],"introduce":[1],"the":[2,13,59,75,105,112,118,152,156,171,175,179,186,216,246],"T-Adaptive":[3],"Segment":[4,32],"Routing,":[5],"a":[6,29,40,68,86,129,165,200],"multi-period":[7,41],"optimization":[8,108],"problem":[9,27],"that":[10,36,73,139],"emerges":[11],"in":[12,81],"traffic":[14],"engineering":[15],"of":[16,31,48,56,78,151,155,167,245],"core":[17],"IP/MPLS":[18],"networks":[19],"when":[20,234],"scheduled":[21,42],"maintenance":[22],"operations":[23],"are":[24,237],"involved.":[25],"The":[26,203],"seeks":[28],"sequence":[30],"Routing":[33],"(SR)":[34],"configurations":[35],"can":[37],"adapt":[38],"to":[39,143,215,239],"maintenance,":[43],"while":[44],"allowing":[45],"limited":[46],"number":[47],"path":[49],"reconfigurations":[50],"between":[51],"successive":[52],"time":[53],"steps.":[54],"Instead":[55],"only":[57,182],"minimizing":[58],"classical":[60],"Maximum":[61],"Link":[62],"Utilization":[63],"(MLU)":[64],"criteria,":[65],"we":[66,98,194],"propose":[67],"more":[69,87],"refined":[70],"lexicographic":[71,107,243],"objective":[72],"minimizes":[74],"sorted":[76],"vector":[77],"link":[79],"loads":[80],"its":[82],"entirety,":[83],"thereby":[84],"enabling":[85],"efficient":[88],"resource":[89],"utilization":[90],"across":[91],"all":[92,235],"links.":[93],"To":[94,190],"tackle":[95],"this":[96,192],"problem,":[97],"develop":[99,128],"three":[100],"exact":[101,149],"formulations":[102,116],"for":[103,123,133,227],"solving":[104,170],"resulting":[106],"problem.":[109],"Among":[110],"these,":[111],"Stela":[113,229],"and":[114,230,233],"Carla":[115,231],"provide":[117],"most":[119],"favorable":[120],"computational":[121],"basis":[122],"trajectory-based":[124],"optimization.":[125],"thus":[127],"trajectory":[130,157,196],"column-generation":[131],"scheme":[132],"these":[134],"formulations,":[135],"using":[136],"pricing":[137,146],"oracles":[138],"vary":[140],"from":[141],"heuristic":[142],"exact.":[144],"Exact":[145],"gives":[147],"an":[148],"solution":[150],"LP":[153],"relaxation":[154],"master,":[158],"but":[159],"it":[160,241],"does":[161],"not":[162],"itself":[163],"give":[164],"certificate":[166],"integer":[168,172,225],"optimality:":[169],"master":[173],"over":[174],"columns":[176],"generated":[177,187],"at":[178],"root":[180],"node":[181],"certifies":[183],"optimality":[184,226,244],"within":[185],"column":[188,197],"pool.":[189],"overcome":[191],"gap,":[193],"incorporate":[195],"generation":[198],"into":[199],"Branch-and-Price":[201,222],"framework.":[202],"branching":[204],"rule":[205],"operates":[206],"on":[207],"aggregate":[208],"variables":[209],"representing":[210],"segment":[211],"usage,":[212],"which":[213],"correspond":[214],"original":[217],"compact":[218],"routing":[219],"variables.":[220],"Thus,":[221],"guarantees":[223,242],"global":[224],"every":[228],"rank,":[232],"ranks":[236],"solved":[238],"exactness,":[240],"final":[247],"solution.":[248]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-01T00:00:00"}