Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

DOI10.1145/321832.321847MaRDI QIDQ4770207zbMATH OpenOpenAlexFDO

Authors Mandell Bellmore, Saman Hong

Publication date 1974

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321832.321847

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4097147
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• scientific article; zbMATH DE number 3882227

Cited in

(21)

• The optimum assignments and a new heuristic approach for the traveling salesman problem
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• Approximation algorithms for some vehicle routing problems
• The multiagent planning problem
• Algorithms for the design of network topologies with balanced disjoint rings
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
• Sequential search and its application to vehicle-routing problems
• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• Strategies for generating well centered tetrahedral meshes on industrial geometries
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
• scientific article; zbMATH DE number 4097147 (Why is no real title available?)
• On general routing problems
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
• The multiple-robot assembly plan problem
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• Approximate minimum tree cover in all symmetric monotone norms simultaneously
• On single courier problem

This page was built for publication: Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770207)