Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm | Publicación