Abstract The Cyclic Bandwidth Problem is an important graph labeling problem with
numerous applications. This work aims to advance the state-of-the-art of practically solving …

The Hamiltonian p‐median problem consists of finding p (pp is given) non‐intersecting
Hamiltonian cycles in a complete edge‐weighted graph such that each cycle visits at least …