The problem has several practical applications in freight transportation and it is
N P-Hard in the strong sense. We propose an exact approach, based on a branchand-cut
algorithm, for the minimization of the routing cost, that iteratively calls a
branch-and-bound algorithm for checking the feasibility of the loadings. Heuristics
1
are also used in order to improve the overall performance of the algorithm. The
effectiveness of the approach is shown by means of computational results