论文信息 - CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS

CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS

Several "tow-commodity" and "multi-commodity" flow formulations have recently been introduced for the traveling salesman problem. The purpose of this paper is to clarify the relations between these formulations and with other classical formulations. (A)

[1] A. Claus. A new formulation for the travelling salesman problem , 1984 .

[2] Lucena Filho,et al. Exact solution approaches for the vehicle routing problem , 1986 .

[3] Stephen C. Graves,et al. The Travelling Salesman Problem and Related Problems , 1978 .

[4] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[5] A Langevin. PLANIFICATION DE TOURNEES DE VEHICULES , 1988 .

[6] Bezalel Gavish,et al. An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[7] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[8] Gerd Finke,et al. Network approach to modelling of flexible manufacturing modules and cells , 1985 .