GraphBU: MILP Instance Generation with Graph-Native Block Units
Mixed-integer linear programming (MILP) instances used for solver development are hard to obtain when models come from private or application-specific pipelines. A generator must keep the structure that solvers and learned policies rely on. Existing general generators usually choose their generation unit from a formulation template, summary statistics, local graph edits, or blocks found after recombination. These units do not explicitly record how a local part of the MILP is coupled to the rest of the instance. We propose GraphBU, a graph-native generator whose basic unit is a local subproblem
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- PossiblePossibly related (embedding) · 51%ZigRazor/CXXGraph →
- PossiblePossibly related (embedding) · 48%langgenius/graphon →
- PossiblePossibly related (embedding) · 47%harnexa/nexa-gauge →
- PossiblePossibly related (embedding) · 47%Tiledesk/design-studio →
- PossiblePossibly related (embedding) · 45%OskarsEzerins/llm-benchmarks →
- LinkedLinked via arxiv author · 85%Xiaolei Guo →
“GraphBU: MILP Instance Generation with Graph-Native Block Units”
- LinkedLinked via arxiv author · 85%Chenyu Zhou →
“GraphBU: MILP Instance Generation with Graph-Native Block Units”
- LinkedLinked via arxiv author · 85%Jianghao Lin →
“GraphBU: MILP Instance Generation with Graph-Native Block Units”