Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem

DOI10.1287/OPRE.36.1.163MaRDI QIDQ3786302zbMATHOpenAlexFDO

Authors Roy Jonker, Ton Volgenant

Publication date 1988

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

vehicle routingsymmetric, single-depot, multiple traveling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Transforming asymmetric into symmetric traveling salesman problems: Erratum
• An improved branching rule for the symmetric travelling salesman problem
• An alternate formulation of the symmetric traveling salesman problem and its properties
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• Symmetric travelling salesman problem. Some new algorithmic possibilities
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem

Cited in

(9)

• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• scientific article; zbMATH DE number 4097147 (Why is no real title available?)
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets

This page was built for publication: Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem

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