{"id":"https://openalex.org/W7134920832","doi":"https://doi.org/10.48550/arxiv.2603.08714","title":"On the Multi-Commodity Flow with convex objective function: Column-Generation approaches","display_name":"On the Multi-Commodity Flow with convex objective function: Column-Generation approaches","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7134920832","doi":"https://doi.org/10.48550/arxiv.2603.08714"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.08714","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.08714","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.08714","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031832917","display_name":"Guillaume Beraud-Sudreau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beraud-Sudreau, Guillaume","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128735275","display_name":"Lucas L\u00e9tocart","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L\u00e9tocart, Lucas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042572418","display_name":"Youcef Magnouche","orcid":"https://orcid.org/0009-0006-3778-703X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Magnouche, Youcef","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128766126","display_name":"S\u00e9bastien Martin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin, S\u00e9bastien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.39340001344680786,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.39340001344680786,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.34389999508857727,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06440000236034393,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6320000290870667},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6184999942779541},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6025000214576721},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.4758000075817108},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.47200000286102295},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.46799999475479126},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4478999972343445},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.40310001373291016}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7016000151634216},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6320000290870667},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6184999942779541},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6025000214576721},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.47200000286102295},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.46799999475479126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45590001344680786},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.40310001373291016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38760000467300415},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.36550000309944153},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2736000120639801},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2669000029563904},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.26010000705718994},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.08714","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.08714","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.08714","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.08714","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,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,163],"purpose":[1],"of":[2,31,77,151],"this":[3,64],"work":[4],"is":[5,21,41,68],"to":[6,22,97,136],"develop":[7],"an":[8],"algorithmic":[9],"optimization":[10],"approach":[11,132],"for":[12,83,174],"a":[13,58,128,171],"capacitated":[14],"Multi-Commodity":[15,91],"flow":[16],"problem,":[17],"where":[18,28,47],"the":[19,24,29,54,72,89,106,119,138],"objective":[20,40],"minimize":[23],"total":[25],"link":[26,59],"costs,":[27],"cost":[30,141,154],"each":[32,122],"arc":[33,145],"increases":[34],"convexly":[35,139],"with":[36,144],"its":[37,100],"utilization.":[38],"This":[39,86],"particularly":[42],"relevant":[43],"in":[44,118,178],"telecommunication":[45,180],"networks,":[46],"device":[48],"performance":[49],"can":[50,110],"deteriorate":[51],"significantly":[52],"as":[53],"available":[55,78],"bandwidth":[56],"on":[57],"becomes":[60],"limited.":[61],"By":[62],"optimizing":[63],"convex":[65,152,160],"function,":[66],"traffic":[67],"efficiently":[69],"distributed":[70,113],"across":[71,114],"network,":[73],"ensuring":[74],"optimal":[75],"use":[76],"resources":[79],"and":[80,94,102],"preserving":[81],"capacity":[82],"future":[84],"demands.":[85],"paper":[87],"describes":[88],"Convex":[90],"Flow":[92],"Problem":[93],"presents":[95],"methodologies":[96],"solve":[98],"both":[99],"Splittable":[101,107],"Unsplittable":[103,120],"variants.":[104],"In":[105],"version,":[108,121],"flows":[109,177],"be":[111,125],"fractionally":[112],"multiple":[115],"paths,":[116],"while":[117],"commodity":[123],"must":[124],"routed":[126],"through":[127],"single":[129],"path.":[130],"Our":[131],"employs":[133],"Column-Generation":[134],"techniques":[135],"address":[137],"increasing":[140,153,161],"functions":[142],"associated":[143],"utilization,":[146],"effectively":[147],"accommodating":[148],"various":[149],"forms":[150],"functions,":[155],"including":[156],"nondifferentiable":[157],"or":[158],"black-box":[159],"functions.":[162],"proposed":[164],"methods":[165],"demonstrate":[166],"strong":[167],"computational":[168],"efficiency,":[169],"offering":[170],"robust":[172],"framework":[173],"managing":[175],"network":[176],"complex":[179],"environments.":[181]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-12T00:00:00"}