Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
We introduce optimality cuts for the K-rooted mini-max spanning forest problem. Optimality cuts are used within a new branch-and-cut algorithm. Extensive computational testings with the new method are carried out. With such an algorithm we are able to substantially improve previous results on the problem.
optimality cuts branch-and-cut combinatorial optimization k-rooted minimax spanning forest problem