- Article
830 Views
26 Pages
The Hamiltonian p-median problem (HpMP) generalizes the classical traveling salesperson (TSP) and the Hamiltonian cycle problems. The HpMP aims to find a collection of p non-intersecting cycles that span all the vertices of a given edge-weighted grap...