Application of the Branch and Cut Method to the Vehicle Routing Problem
The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP. We investigate three classes of valid inequalities for the CVRP, multistars, pathbin inequalities and hypotours and give computational results we obtained with a Branch and Cut implementation.
|Depositing User:||Ulrich Blasum|
|Date Deposited:||15 May 2002 00:00|
|Last Modified:||16 Jan 2012 13:39|