The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …

This paper surveys learning techniques to deal with the two most crucial decisions in the
branch-and-bound algorithm for Mixed-Integer Linear Programming, namely variable and …

The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming frame-work SCIP. This …

We report on the selection process leading to the sixth version of the Mixed Integer
Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new …

This article describes new features and enhanced algorithms made available in version 5.0
of the SCIP Optimization Suite. In its central component, the constraint integer programming …

Distributed generation (DG) based on rooftop photovoltaic (PV) systems with battery
storages is a promising alternative energy generation technology to reduce global …

The design of strategies for branching in Mixed Integer Programming (MIP) is guided by
cycles of parameter tuning and offline experimentation on an extremely heterogeneous …

Abstract Machine learning (ML) has been recently introduced to solving optimization
problems, especially for combinatorial optimization (CO) tasks. In this paper, we survey the …

Comparing, or benchmarking, of optimization algorithms is a complicated task that involves
many subtle considerations to yield a fair and unbiased evaluation. In this paper, we …

This paper presents a mixed-integer linear programming (MILP) reformulation of the thermal
unit commitment (UC) problem. The proposed formulation is simultaneously tight and …