BOBILib: Bilevel Optimization (Benchmark) Instance Library

Abstract In this report, we present the , 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 .

Authors

Institutions

Publication Details

Journal
Mathematical Programming Computation
Published
2026-03-21
DOI
https://doi.org/10.1007/s12532-025-00294-y
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

BOBILib: Bilevel Optimization (Benchmark) Instance Library

Ivana Ljubić, Ted K. Ralphs, Johannes Thürauf, Thomas Kleinert et al.
Mathematical Programming Computation
Optimization and Variational Analysis
article

BOBILib: Bilevel Optimization (Benchmark) Instance Library

Ivana Ljubić, Ted K. Ralphs, Johannes Thürauf, Thomas Kleinert, Martin Schmidt
article en

Abstract

Abstract In this report, we present the , 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 .

Mathematical Programming Computation
École Supérieure des Sciences Économiques et Commerciales (FR), Lehigh University (US), Lutheran University of Applied Sciences Nuremberg (DE), CY Cergy Paris Université (FR), Munich Center for Quantum Science and Technology (DE), Universität Trier (DE)
Openalex Percentile: Top 12%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.