In mathematics, the capacitated arc routing problem (CARP) is that of finding the shortest tour with a minimum graph/travel distance of a mixed graph...

Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and...

Routing Problem with Time Windows (VRPTW): The delivery locations have time windows within which the deliveries (or visits) must be made. Capacitated...

Belenguer, and E. Benavent, "A cutting plane algorithm for capacitated arc routing problem," Computers & Operations Research, vol.30, no.5, pp.705-728...

problem by operating on a population. The algorithm performed well compared to other approximation algorithms for the MCPP. Capacitated arc routing problem...

Bandwidth problem: GT40  Bipartite dimension: GT18  Capacitated minimum spanning tree: ND5  Route inspection problem (also called Chinese postman problem) for...

transformation allows the MLC problem to be polynomially reducible to the minimum cost flow (MCF) problem in the extended capacitated network D'(W). The complexity...

scheduling-based approach to multi-agent path finding with weighted and capacitated arcs" (PDF). Proceedings of the 17th International Conference on Autonomous...

capacity parameters. A recurring problem is trying to determine the minimum cost route between two points in a capacitated network. The idea of the algorithm...

"Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension". 26th Annual European Symposium...