Another noteworthy development is a distributed algorithm for computing the weighted girth, which is the length of the minimum-weight cycle in a graph [2].

We consider the asymmetric capacitated vehicle routing problem (CVRP), a particular case of the standard asymmetric vehicle routing problem in which only the vehicle capacity constraints are imposed.