Sign inGet started
Paper · arXiv

MPMMine: Better Benchmarks for Constraint Acquisition

Constraint Acquisition (CA) and related research on the validation and enhancement of Mathematical Programming (MP) models using domain knowledge artifacts are currently limited by inadequate benchmarks. The existing benchmarks are loosely organized, provide inconsistent types and formats of artifacts for individual problems, are designed for benchmarking solvers rather than CA algorithms, include narrow classes of problems, or omit crucial details for the reproducibility of experiments and fair comparison of CA methods. We develop a benchmark dataset, a supporting software package, and a benchmarking tool crafted for the consistent, systematic, and comprehensive assessment of CA algorith...

AuthorsRafał Stachowiak, Tomasz P. Pawlak
Primary categorycs.AI
Published25 May 2026
Last updated at source9 October 2026
cs.AIcs.CE
Embed this entry
<iframe src="https://silytics.si/embed/item/c4d66978-97a8-4224-b021-278504d24838" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.