In this paper, we introduce, study and analyze several classes of compact formulations for the symmetric Hamiltonian
‐median problem (H
MP). Given a positive integer
and a weighted complete undirected graph
with weights on the edges, the H
MP on
is to find a minimum weight set of
elementary cycles partitioning the vertices...