Open AccessComputer ScienceMathematics

An efficient transformation of the generalized traveling salesman problem

C. Noon, J. C. Bean

1993.2.1INFOR

DOI: 10.1080/03155986.1993.11732212

tlooto Summary

This paper shows how to efficiently transform a GTSP into a standard asymmetric Traveling Salesman Problem (TSP) over the same number of nodes and allows certain routing problems which involve discrete alternatives to be modeled using the TSP framework.

Abstract

Abstract is not available.

Citation format

NOON, C.; BEAN, J. C. An efficient transformation of the generalized traveling salesman problem. INFOR, 1993, 31: 39–44.