Richard Bellman
- 1 DANTZlC, G. B.; FULKERSON, D. R., AND JOHNSON, S. M. On a linear programming combinatorial approach to the travelling salesman problem. Operations Res. 7 (1959), t.Google Scholar
- 2 MILLER, C. E.; TUCKER, A. W., AND ZEMLIN, R. A-. Integer programming formulation and travelling salesman problems. J. ACM 7 (1960), 326-329. Google Scholar
- 3 BELLMAN, R. Dynamic Programming. Princeton University Press, Princeton, New Jersey, 1957. Google Scholar
Index Terms
- Dynamic Programming Treatment of the Travelling Salesman Problem
Recommendations
The Traveling Salesman Location Problem
The problem of locating a single new facility relative to m existing facilities has been studied extensively under the assumption that trips are always made between the new facility and a single existing facility each time a trip occurs. A variation of ...
A swarm intelligence approach for the colored traveling salesman problem
This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though ...
A Fast Evolutionary Algorithm for Traveling Salesman Problem
ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 04In this paper we proposed a new algorithm based on Inver-over operator, for traveling salesman problems (TSP). Inver-over is based on simple inversion; however, knowledge taken from other individuals in the population influences its action. In the new ...
Comments