The Capacitated Arc Routing Problem: Lower bounds
Data up to Jan 2025
Total Citations Per Year
Abstract
References (20)
Complexity of vehicle routing and scheduling problems
1981 • 1,194 citations
Routing and scheduling of vehicles and crews
1983 • 849 citations
Capacitated arc routing problems
1981 • 547 citations
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
1981 • 510 citations
Networks and vehicle routing for municipal waste collection
1974 • 475 citations
Classification in vehicle routing and scheduling
1981 • 329 citations
State‐space relaxation procedures for the computation of bounds to routing problems
1981 • 321 citations
Computational experiments with algorithms for a class of routing problems
1983 • 300 citations
Vehicle Routing with Time Windows
1987 • 300 citations
The optimum traversal of a graph
1973 • 119 citations
Routing electric meter readers
1979 • 88 citations
An analysis of alternative strategies for implementing matching algorithms
1983 • 80 citations
A shortest augmenting path method for solving minimal perfect matching problems
1981 • 70 citations
The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
1987 • 57 citations
A parallel insert method for the capacitated arc routing problem
1984 • 57 citations
Districting and Routing for Solid Waste Collection
1978 • 47 citations
New lower bounds for the Capacitated Arc Routing Problem
1988 • 36 citations
The capacitated arc routing problem. A heuristic algorithm
1990 • 27 citations
NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
1992 • 24 citations
Problemas de rutas por arcos
1983 • 9 citations