Publication | Closed Access

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringRoute PlanningTraveling Salesman ProblemCombinatorial ProblemDistance ConstraintsSystems EngineeringLogisticsVehicle Routing ProblemDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingOperations Research