A Branch-and-Cut algorithm for the Median-Path problem