Publication | Closed Access

A branch-and-bound algorithm for the mini-max spanning forest problem

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringGraph TheoryOptimization ProblemComputer ScienceDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationBranch And BoundOperations Research