Jonker, Roy; Volgenant, Ton Identification of non-optimal arcs for the traveling salesman problem. (English) Zbl 0487.90089 Oper. Res. Lett. 1, 85-88 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 9 Documents MSC: 90C35 Programming involving graphs or networks 65K05 Numerical mathematical programming methods Keywords:traveling salesman problem; 3-optimality; non-optimal arcs; elimination of arcs PDFBibTeX XMLCite \textit{R. Jonker} and \textit{T. Volgenant}, Oper. Res. Lett. 1, 85--88 (1982; Zbl 0487.90089) Full Text: DOI References: [1] Garfinkel, R. S.; Nemhauser, G. L., Integer Programming (1972), Wiley: Wiley New York · Zbl 0271.90028 [2] Jonker, R.; Kaas, R.; Volgenant, A., Data-dependent bounds for heuristics to find a minimum weight hamiltonian circuit, Operations Res., 28, 1219-1222 (1980) · Zbl 0449.90093 [3] Lin, S., Computer solutions of the traveling salesman problem, Bell System Tech. J., 44, 2245-2269 (1965) · Zbl 0136.14705 [4] Volgenant, A.; Jonker, R., A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, European J. Operations Res., 9, 83-89 (1982) · Zbl 0471.90088 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.