In this paper, we introduce, study and analyze several classes of compact formulations for the symmetric Hamiltonian p $$ -median problem (H MP). Given a positive integer weighted complete undirected graph G = ( V , E ) G=\left(V,E\right) with weights on edges, H MP is to find minimum weight set elementary cycles partitioning vertices . The advantage developing that they can be readily used in ...