A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
Katrin Heßler, Stefan Irnich
Topics & Concepts
Vehicle routing problemBranch and cutTravelling salesman problemMathematicsBenchmark (surveying)Mathematical optimizationHeuristicCutting-plane methodReduction (mathematics)Cluster analysisBounding overwatchColumn generationAlgorithmEuclidean geometryRouting (electronic design automation)Triangle inequalityGridComputer scienceInteger programmingCombinatoricsArtificial intelligenceGeographyStatisticsGeodesyGeometryComputer networkVehicle Routing Optimization MethodsOptimization and Packing ProblemsAdvanced Manufacturing and Logistics Optimization