Procedures for travelling salesman problems with additional constraints

DOI10.1016/0377-2217(79)90099-7zbMath0396.90099OpenAlexW2164673645MaRDI QIDQ1253617

F. C. J. Lokin

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90099-7

zbMATH Keywords

AlgorithmTraveling Salesman ProblemClusters of Cities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items

Approximation Algorithms for Not Necessarily Disjoint Clustered TSP, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem, Metaheuristics for the tabu clustered traveling salesman problem, The traveling salesman problem with backhauls, Vertices removal for feasibility of clustered spanning trees, Self-organizing feature maps for the vehicle routing problem with backhauls, Dynamic programming in the routing problem: decomposition variant, An adaptive memory matheuristic for the set orienteering problem, Achieving feasibility for clustered traveling salesman problems using PQ‐trees, On the question of the optimization of permutations in the problem with dynamic constraints, A Heuristic Approach for Cluster TSP, An exact algorithm for the clustered travelling salesman problem, Cluster-level operations planning for the out-of-position robotic arc-welding, The symmetric clustered traveling salesman problem, A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems, An algorithm for the traveling salesman problem with pickup and delivery customers

Cites Work

• An Algorithm for the Traveling Salesman Problem
• The traveling-salesman problem and minimum spanning trees: Part II