{"id":"https://openalex.org/W7128701634","doi":"https://doi.org/10.48550/arxiv.2602.11057","title":"Divide, Harmonize, Then Conquer It: Shooting Multi-Commodity Flow Problems with Multimodal Language Models","display_name":"Divide, Harmonize, Then Conquer It: Shooting Multi-Commodity Flow Problems with Multimodal Language Models","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128701634","doi":"https://doi.org/10.48550/arxiv.2602.11057"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.11057","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11057","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.11057","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125761308","display_name":"Xinyu Yuan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuan, Xinyu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125747879","display_name":"Yan Qiao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiao, Yan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124899318","display_name":"Zonghui Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zonghui","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101562846","display_name":"Wenzhi Chen","orcid":"https://orcid.org/0000-0002-9692-4747"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Wenzhi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5125761308"],"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.3944999873638153,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.3944999873638153,"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.12720000743865967,"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.09399999678134918,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5425999760627747},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5358999967575073},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5110999941825867},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4499000012874603},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.38830000162124634},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.38179999589920044},{"id":"https://openalex.org/keywords/factoring","display_name":"Factoring","score":0.38040000200271606},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3790000081062317}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8476999998092651},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5425999760627747},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5358999967575073},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5110999941825867},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4187999963760376},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.38830000162124634},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C177225278","wikidata":"https://www.wikidata.org/wiki/Q192674","display_name":"Factoring","level":2,"score":0.38040000200271606},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3790000081062317},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35920000076293945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34769999980926514},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3296000063419342},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C2778496695","wikidata":"https://www.wikidata.org/wiki/Q254128","display_name":"Dilemma","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.11057","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11057","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.11057","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11057","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"multi-commodity":[1],"flow":[2,11,191],"(MCF)":[3],"problem":[4,90],"is":[5,201],"a":[6,69,112,211],"fundamental":[7],"topic":[8],"in":[9,18,38,128,154],"network":[10],"and":[12,21,41,102,145,153,168,203,213],"combinatorial":[13],"optimization,":[14],"with":[15,206],"broad":[16],"applications":[17],"transportation,":[19],"communication,":[20],"logistics,":[22],"etc.":[23],"Nowadays,":[24],"the":[25,49,55,65,88,133,136,165],"rapid":[26],"expansion":[27],"of":[28,58,72,77,138,176],"allocation":[29,208],"systems":[30],"has":[31],"posed":[32],"challenges":[33],"for":[34,63,216],"existing":[35],"optimization":[36],"engines":[37],"balancing":[39],"optimality":[40],"tractability.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46,118],"present":[47],"Pram,":[48,121],"first":[50],"ML-based":[51],"method":[52],"that":[53,120],"leverages":[54],"reasoning":[56],"power":[57],"multimodal":[59],"language":[60],"models":[61],"(MLMs)":[62],"addressing":[64],"trade-off":[66],"dilemma":[67],"--":[68],"great":[70],"need":[71],"service":[73],"providers.":[74],"As":[75],"part":[76],"our":[78],"proposal,":[79],"Pram":[80,148,180,200],"(i)":[81],"quickly":[82],"computes":[83],"high-quality":[84],"allocations":[85],"by":[86,98,107],"dividing":[87],"original":[89],"into":[91],"local":[92],"subproblems,":[93],"which":[94,122],"are":[95],"then":[96],"resolved":[97],"an":[99],"MLM-powered":[100],"\"agent\",":[101],"(ii)":[103],"ensures":[104],"global":[105],"consistency":[106],"harmonizing":[108],"these":[109],"subproblems":[110],"via":[111],"multi-agent":[113],"reinforcement":[114],"learning":[115],"algorithm.":[116],"Theoretically,":[117],"show":[119],"learns":[123],"to":[124,132,164,173,197],"perform":[125],"gradient":[126],"descent":[127],"context,":[129],"provably":[130],"converges":[131],"optimum":[134],"within":[135],"family":[137],"MCF":[139],"problems.":[140],"Empirically,":[141],"on":[142],"real-world":[143],"datasets":[144],"public":[146],"topologies,":[147],"achieves":[149],"performance":[150,185],"comparable":[151],"to,":[152],"some":[155],"cases":[156],"even":[157],"surpassing,":[158],"linear":[159],"programming":[160],"solvers":[161],"(very":[162],"close":[163],"optimal":[166],"solution),":[167],"substantially":[169],"lower":[170],"runtimes":[171],"(1":[172],"2":[174],"orders":[175],"magnitude":[177],"faster).":[178],"Moreover,":[179],"exhibits":[181],"strong":[182],"robustness":[183],"(<10\\%":[184],"degradation":[186],"under":[187],"link":[188],"failures":[189],"or":[190],"bursts),":[192],"demonstrating":[193],"MLM's":[194],"generalization":[195],"ability":[196],"unforeseen":[198],"events.":[199],"objective-agnostic":[202],"seamlessly":[204],"integrates":[205],"mainstream":[207],"systems,":[209],"providing":[210],"practical":[212],"scalable":[214],"solution":[215],"future":[217],"networks.":[218]},"counts_by_year":[],"updated_date":"2026-02-13T13:40:29.240086","created_date":"2026-02-13T00:00:00"}