Minimum-Peak-Cost Flows Over Time

\(\) Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimising peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC-MTRF problem. First, we discuss the limitations that emerge when restricting the solution space to … Read more

Cover-based inequalities for the single-source capacitated facility location problem with customer preferences

The single-source capacitated facility location problem with customer preferences (SSCFLPCP) is known to be strongly NP-hard and computational tests imply that state-of-the-art solvers struggle with computing exact solutions. In this paper, we contribute two novel preprocessing methods, which reduce the size of the considered integer programming formulation, and introduce sets of valid inequalities, which decrease the … Read more