Transformation of multidepot multisalesmen problem to the standard travelling salesman problem

DOI10.1016/0377-2217(94)00011-ZzbMath0912.90278OpenAlexW1975115240MaRDI QIDQ1130070

Guoxing Yang

Publication date: 5 November 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00011-z

zbMATH Keywords

travelling salesmanimaginary depotsmultidepot multisalesmen problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Multi-depot multiple TSP: a polyhedral study and computational results ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Strategies for parallel unaware cleaners ⋮ Multiperiod location-routing with decoupled time scales ⋮ An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem ⋮ A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem ⋮ Integer linear programming formulations of multiple salesman problems and its variations

Cites Work

• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

This page was built for publication: Transformation of multidepot multisalesmen problem to the standard travelling salesman problem