Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

Authors:
Mandell Bellmore;Saman Hong
Affiliations:
Block, McGibony & Associates, Inc., Silver Spring, Maryland;Department of Statistics, Baruch College, The City University of New York, 17 Lexington Ave., New York, NY
Venue:
Journal of the ACM (JACM)
Year:
1974

Citing 1
Cited 11

Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)

Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
Sequential search and its application to vehicle-routing problems

Computers and Operations Research
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms
Courier problems

Crossroads
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms
Algorithms for the design of network topologies with balanced disjoint rings

Journal of Heuristics
The traveling salesman: computational solutions for TSP applications

The traveling salesman: computational solutions for TSP applications
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems

Applied Soft Computing
Differential approximation for some routing problems

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Optimizing data collection path in sensor networks with mobile elements

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the multisalesmen problem can be solved by solving the standard traveling salesman problem on an expanded graph. The expanded graph has m — 1 more nodes than the original graph where m is the number of salesmen available at the base.