A branch-and-cut algorithm for the elementary shortest path problem with resource constraints