Publication | Closed Access

Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringTraveling Salesman ProblemCombinatorial ProblemComputational ComplexityDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationBranch And BoundInteger ProgrammingOperations Research