A comparison of several models for the hamiltonian p-median problem

Given a finite, simple, and undirected graph G = ( V , E ), a P 3-convex set of G is a set S ⊆ V ( G ) such that every vertex of V ( G ) ∖ S has at most one neighbor in S, and the P 3-convex hull of a vertex subset S ′ of G is the ...

A celebrated theorem of Chvatal and Erdos says that G is Hamiltonian if @k(G)>=@a(G), where @k(G) denotes the vertex connectivity and @a(G) the independence number of G. Moreover, Bondy suggested that almost any non-trivial conditions for Hamiltonicity ...

In the Hamiltonian p-median problem HpMP, the target is to find p cycles that partition a given undirected graph with the objective of minimizing the total sum of the costs of these p cycles. Even though this problem has several applications, the current ...