Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
Robert Garfinkel · Operations Research · 1973
This note develops a branching scheme for a branch-and-bound algorithm for the traveling-salesman problem. It improves on the algorithm of Bellmore and Malone in that a partition of the feasible set is achieved at every vertex of the enumeration tree.