Publication | Closed Access

Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringTraveling Salesman ProblemCombinatorial ProblemLogisticsVehicle Routing ProblemSalesman ProblemDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationHeuristic SearchInteger ProgrammingOperations Research