Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...

Abstract: This study shows the effectiveness of the cutting plane method by applying it to the facility location problem with probabilistic constraints. Probabilistic constraints are those that should ...

This is the companion repository to Herman Appelgren's MSc thesis "Cutting Planes for Mixed Integer Optimization". It contains an implementation of the cutting plane sparsification algorithm described ...

Abstract: This paper presents an application of the Multi-Objective Branch-and-Bound based on Decomposition (MOBB/D) method for Branch-and-Cut, combining branch-and-bound and cutting-plane methods.