A Branch-and-Cut Algorithm for the Median-Path Problem