Publication | Closed Access

A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints

Mathematical ProgrammingVehicle RoutingBranch-and-bound AlgorithmEngineeringBranch-and-cut AlgorithmScheduling ProblemRoute PlanningLogisticsSystems EngineeringGrouping ConstraintsVehicle Routing ProblemCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingOperations Research