Papers › Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods

Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods

11 Jun 2024arXiv:2406.06954archive 2025-07-28

Weimin Huang, Taoan Huang, Aaron M Ferber, Bistra Dilkina

Mixed Integer Linear Programming (MILP) is a fundamental tool for modeling combinatorial optimization problems. Recently, a growing body of research has used machine learning to accelerate MILP solving. Despite the increasing popularity of this approach, there is a lack of a common repository that provides distributions of similar MILP instances across different domains, at different hardness levels, with standardized test sets. In this paper, we introduce Distributional MIPLIB, a multi-domain library of problem distributions for advancing ML-guided MILP methods. We curate MILP distributions from existing work in this area as well as real-world problems that have not been used, and classify them into different hardness levels. It will facilitate research in this area by enabling comprehensive evaluation on diverse and realistic domains. We empirically illustrate the benefits of using Distributional MIPLIB as a research vehicle in two ways. We evaluate the performance of ML-guided variable branching on previously unused distributions to identify potential areas for improvement. Moreover, we propose to learn branching policies from a mix of distributions, demonstrating that mixed distributions achieve better performance compared to homogeneous distributions when there is limited data and generalize well to larger instances. The dataset is publicly available at https://sites.google.com/usc.edu/distributional-miplib/home.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2406.06954")

Code

Syntology Ran 5 of 6 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 5 ran with no contract checked.

By repository: official repository: 6 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 5 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

5ran
1unverified

Licence: 0 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from amf272/Distributional-MIPLIB-Generators. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

gen_graph amf272/Distributional-MIPLIB-Generators/MVC/generator_MVC.py official repository ran MIT (permissive) · 0e7b2fffe89e8142 · report
getEdgeVar amf272/Distributional-MIPLIB-Generators/MVC/generator_MVC.py official repository ran MIT (permissive) · 0310049d859e5632 · report
parseCor amf272/Distributional-MIPLIB-Generators/Corridor/lib/corMIPGen.py official repository ran MIT (permissive) · 45f46f62a0919dfa · report
partition_edges amf272/Distributional-MIPLIB-Generators/GISP/gisp.py official repository ran MIT (permissive) · dd7e516683e4561b · report
read_dimacs amf272/Distributional-MIPLIB-Generators/GISP/generate_dimacs.py official repository ran MIT (permissive) · f90553cb93012f22 · report
getNodeVar amf272/Distributional-MIPLIB-Generators/MVC/generator_MVC.py official repository unverified MIT (permissive) · 29f1e018c3defa2f · report

Tasks

Combinatorial Optimization

Datasets

Introduced by this paper, per the archive.

Distributional MIPLIB

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections