An exact algorithm for the asymmetrical capacitated vehicle routing problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (17)
Reducibility among Combinatorial Problems
1972 • 10,743 citations
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
1964 • 3,673 citations
Partitioning procedures for solving mixed-variables programming problems
1962 • 3,587 citations
An Algorithm for the Traveling Salesman Problem
1963 • 1,029 citations
ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART
1983 • 1,004 citations
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
1981 • 510 citations
State‐space relaxation procedures for the computation of bounds to routing problems
1981 • 321 citations
Optimal Routing under Capacity and Distance Restrictions
1985 • 299 citations
Some Simple Applications of the Travelling Salesman Problem
1975 • 258 citations
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
1980 • 168 citations
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
1981 • 158 citations
A branch and bound algorithm for the capacitated vehicle routing problem
1983 • 152 citations
On the symmetric travelling salesman problem: A computational study
1980 • 151 citations
A restricted Lagrangean approach to the traveling salesman problem
1981 • 145 citations
The vehicle routing problem
1976 • 132 citations
A Cutting Planes Algorithm for the m-Salesmen Problem
1980 • 132 citations
Two exact algorithms for the distance‐constrained vehicle routing problem
1984 • 119 citations