Publication | Open Access
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
137
Citations
4
References
1974
Year
Mathematical ProgrammingEngineeringMultisalesman ProblemDiscrete OptimizationOperations ResearchTraveling Salesman ProblemMultisalesmen ProblemLogisticsSalesman ProblemDiscrete MathematicsCombinatorial OptimizationOriginal GraphCombinatorial ProblemInteger ProgrammingGraph TheoryOptimization ProblemBusinessVehicle Routing ProblemHeuristic Search
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1