Journal article
MIPLIBing: Seamless Benchmarking of Mathematical Optimization Problems and Metadata Extensions
SN Operations Research Forum, Vol.1(3), pp.1-6
09/01/2020
DOI: 10.1007/s43069-020-00024-1
Abstract
Public libraries of problems such as Mixed Integer Programming Library (MIPLIB) are fundamental to creating a common benchmark for measuring algorithmic advances across mathematical optimization solvers. They also often provide metadata on problem structure, hardness with respect to state-of-the-art solvers, and solutions with the best objective function value on record. In this short paper, we discuss some ways in which such metadata can be leveraged to create a seamless testing experience. In particular, we present MIPLIBing: a Python library that automatically downloads queried subsets from the current versions of MIPLIB, MINLPLib, and QPLIB, provides a centralized local cache across projects, and tracks the best solution values and bounds on record for each problem. While inspired by similar use cases from other areas, we reflect on the specific needs of mathematical optimization and discuss opportunities to extend benchmark sets to facilitate experimentation with different model structures.
Details
- Title: Subtitle
- MIPLIBing: Seamless Benchmarking of Mathematical Optimization Problems and Metadata Extensions
- Creators
- Thiago Serra - Bucknell UniversityRyan J. O’Neil - nextmv
- Resource Type
- Journal article
- Publication Details
- SN Operations Research Forum, Vol.1(3), pp.1-6
- DOI
- 10.1007/s43069-020-00024-1
- ISSN
- 2662-2556
- eISSN
- 2662-2556
- Publisher
- Springer International Publishing
- Language
- English
- Date published
- 09/01/2020
- Academic Unit
- Business Analytics
- Record Identifier
- 9984696657802771
Metrics
10 Record Views