zbMATH — the first resource for mathematics

A survey of some non-standard traveling salesman problems. (English) Zbl 0772.90078
Summary: We present a survey of some non-standard traveling salesman problems (TSP) with emphasis on the authors’ contributions. The results include complexity indices and \(k\)-best solutions for the ordinary TSP, the TSP on a chained structure, a multi-TSP on a bandwidth-limited digraph as well as the corresponding general case, a generalized TSP as well as the description of some software for TSP.
90C35 Programming involving graphs or networks
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
90C27 Combinatorial optimization
90C60 Abstract computational complexity for mathematical programming problems
90C39 Dynamic programming