arrow
Return

BOBILib: Bilevel Optimization (Benchmark) Instance Library

delete2026-03-21
delete0
delete
OA
AI
J
Johannes Thürauf *
T
Thomas Kleinert
I
Ivana Ljubić
T
Ted K. Ralphs
M
Martin Schmidt
DOI:10.1007/s12532-025-00294-ydelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In this report, we present the BOBILib, a collection of more than 2600 instances of mixed integer bilevel linear optimization problems (MIBLPs). The goal of this library is to provide a large and well-curated set of test instances freely available for the research community so that new and existing algorithms in bilevel optimization can be tested and compared in a standardized way. The library is sub-divided into instances of different types and also contains different benchmark instance sets. Moreover, we present a new data format for MIBLPs that is less error-prone compared to an older format that will now be deprecated. We provide numerical results for all instances of the library using available bilevel solvers. Based on these numerical results, we select benchmark instance sets, which provide a meaningful basis for experimental comparisons of solution methods in a moderate time. The instances, together with solution files, can be downloaded at https://bobilib.org .
Keywords:
Mixed integer bilevel linear optimization
Benchmarking
Instance library
Problem instances
Computational optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Mathematical Programming Computation cover
Mathematical Programming Computation
IF:
3.6
Papers:
197
Citations:
1.9K

Organization

L
liberal arts and social sciences
Scholars:
2
Papers: 3
Citations: 0
I
industrial and systems engineering
Scholars:
62
Papers: 34
Citations: 0
M
mathematics
Scholars:
913
Papers: 533
Citations: 0
E
ESSEC Business School
Scholars:
439
Papers: 753
Citations: 1
researcher View more organizations