Branch and bound methods. (English) Zbl 0568.90068

The traveling salesman problem, a guided tour of combinatorial optimization, 361-401 (1985).
[For the entire collection see Zbl 0562.00014.]
A comprehensive review is given of branch and bound methods designed for the traveling salesman problem. The treatment includes an empirical analysis of the performance of the algorithms.
Reviewer: J.K.Lenstra


90C10 Integer programming
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
65K05 Numerical mathematical programming methods
90C35 Programming involving graphs or networks


Zbl 0562.00014