The aim of this letter is to design and computationally test several improvements for the compact integer linear programming (ILP) formulations of the temporal bin packing problem with fire-ups (TBPP-FU). This problem is a challenging generalization of the classical bin packing problem in which...

Given a directed graph with capacities and blocker costs associated with its arcs, we study the maximum flow blocker problem (MFBP) which asks to find a minimum-cost subset of arcs to be removed from the graph in such a way that the remaining maximum-flow value does not exceed a given threshold....

Real‐world problems are becoming highly complex and therefore have to be solved with combinatorial optimization (CO) techniques. Motivated by the strong increase in publications on CO, 8393 articles from this research field are subjected to a bibliometric analysis. The corpus of literature is...