← Back to all news
arXiv Machine Learning By Xiaolei Guo, Chenyu Zhou, Jianghao Lin, Dongdong Ge

GraphBU: MILP Instance Generation with Graph-Native Block Units

Read the original on arXiv Machine Learning →

arXiv:2607. 06532v1 Announce Type: new Abstract: Mixed-integer linear programming (MILP) instances used for solver development are hard to obtain when models come from private or application-specific pipelines.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

Hugging Face Trending Papers
Aug 20

Learning Early-to-Final Solution Consistency for MILP Acceleration

Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making. Owing to their NP-hardness, however, modern solvers may struggle to find high-quality solutions for challenging MILP instances within practical time limits.

benchmarks
More like this →
arXiv Machine Learning
1d ago

Reformulation-Contrastive Learning for Mixed Integer Programs

The paper introduces ReMILP, a reformulation‑contrastive learning framework that uses self‑supervision from equivalent formulations of mixed‑integer linear programs (MILPs). By distinguishing re‑descriptions and substitutions, the method trains a graph neural network and a hypernetwork to predict how variable embeddings transform under changes of variables, achieving invariance and equivariance without solver‑derived labels. The learned representations prove useful for tasks such as binary solution, constraint activity, and integrality gap prediction, and serve as a strong initialization for fine‑tuning.

By Ousema Bouaneni, Mathis Le Bail, Cl\'ement Elliker, Ma\"el Jenny, Sonia Vanier
ragfine-tuning
More like this →