MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library

DOI10.1007/S12532-020-00194-3zbMath1476.90191OpenAlexW3085454911MaRDI QIDQ2062317

Kati Jarck, Michael Bastubbe, Timo Berthold, Tobias Achterberg, Philipp Christophel, Derya Ozyurt, Marco E. Lübbecke, Yuji Shinano, Jeff Linderoth, Ambros M. Gleixner, Thorsten Koch, Gerald Gamrath, Gregor Hendel, Domenico Salvagnin, Hans D. Mittelmann, Ted K. Ralphs

Publication date: 27 December 2021

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-020-00194-3

zbMATH Keywords

benchmarkingMIPmixed integer linear optimizationinstance libraryselection methodology

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Mixed integer programming (90C11) Boolean programming (90C09)

Related Items (31)

Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Adaptive large neighborhood search for mixed integer programming ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ MPILS: an automatic tuner for MILP solvers ⋮ Maritime inventory routing: recent trends and future directions ⋮ Cutting plane selection with analytic centers and multiregression ⋮ Local branching relaxation heuristics for integer linear programs ⋮ Online learning for scheduling MIP heuristics ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ Efficient separation of RLT cuts for implicit and explicit bilinear products ⋮ Recycling inequalities for robust combinatorial optimization with budget uncertainty ⋮ Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Adaptive solution prediction for combinatorial optimization ⋮ Progress in mathematical programming solvers from 2001 to 2020 ⋮ Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization ⋮ Adaptive cut selection in mixed-integer linear programming ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ Feasibility jump: an LP-free Lagrangian MIP heuristic ⋮ EETTlib—Energy‐efficient train timetabling library ⋮ Random projections of linear and semidefinite problems with linear inequalities ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework ⋮ A computational status update for exact rational mixed integer programming ⋮ MIPLIB ⋮ Face dimensions of general-purpose cutting planes for mixed-integer linear programs ⋮ An algorithm-independent measure of progress for linear constraint propagation

Uses Software

• gmp
• SCIP
• UG
• AMPL
• Gurobi
• OR-Library
• Cbc
• Benchmarks for Optimization Software
• Mosek
• XPRESS
• MINLPLib
• DipPy
• SAS/OR
• ParaSCIP
• MIPLIB2003
• DIP
• AS 136
• ASlib
• t-SNE
• QPLIB
• IPET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• Algorithm AS 136: A K-Means Clustering Algorithm
• ASlib: a benchmark library for algorithm selection
• Towards objective measures of algorithm performance across instance space
• Generating new test instances by evolving in instance space
• Progress in presolving for mixed integer programming
• QPLIB: a library of quadratic programming instances
• MIPLIB 2003
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
• Presolve Reductions in Mixed Integer Programming
• Solving Real-World Linear Programs: A Decade and More of Progress
• Reporting computational experiments in mathematical programming
• Needed: An Empirical Science of Algorithms
• The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Computational Experience in Solving Linear Programs

This page was built for publication: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library