Branch-and-cut

Solving a Variant of the Hub Location-Routing Problem

We investigate a variant of the many-to-many (hub) location-routing problem, which consists in partitioning the set of vertices of a graph into cycles containing exactly one hub each, and determining an extra cycle interconnecting all hubs. A local …

Solving a variant of the (hub) location-routing problem

We investigate a variant of the many-to-many (hub) location-routing problem, which consists in partitioning the set of vertices of a graph into cycles containing exactly one hub each, and determining an extra cycle interconnecting all hubs. A local …