Technical Note—A Note on the Multiple Traveling Salesmen Problem

DOI10.1287/opre.28.3.628zbMath0442.90068OpenAlexW2047386472MaRDI QIDQ3885526

No author found.

Publication date: 1980

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

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

zbMATH Keywords

asymmetric traveling salesman problemequivalent problem transformationfixed changes symmetric multiple traveling salesmen problemm salesmenn cities

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (10)

Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem ⋮ A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem ⋮ The multiple-robot assembly plan problem ⋮ Sequential search and its application to vehicle-routing problems ⋮ An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets ⋮ On the shortest path problem with negative cost cycles ⋮ A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem

This page was built for publication: Technical Note—A Note on the Multiple Traveling Salesmen Problem