Nonoptimal Edges for the Symmetric Traveling Salesman Problem

DOI10.1287/opre.32.4.837zbMath0546.90095OpenAlexW2001094832MaRDI QIDQ3337972

Roy Jonker, Ton Volgenant

Publication date: 1984

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.32.4.837

zbMATH Keywords

identification rulessymmetric traveling salesmanelimination of nonoptimal edges

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

Improving Christofides' lower bound for the traveling salesman problem, Edge Elimination in TSP Instances, Better assignment lower bounds for the Euclidean traveling salesman problem, Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals, Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem., Special Frequency Quadrilaterals and an Application, Generalization of machine learning for problem reduction: a case study on travelling salesman problems, A new heuristic for the fleet size and mix vehicle routing problem, Symmetric traveling salesman problems, The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem, Optimizing tabu list size for the traveling salesman problem, The symmetric clustered traveling salesman problem, Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem, A branch and bound algorithm for symmetric 2-peripatetic salesman problems, Special cases of the traveling salesman problem, A note on finding a shortest complete cycle in an undirected graph