Open AccessNote—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
Author(s) -
Bezalel Gavish
Publication year - 1976
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.22.6.704
Subject(s) - travelling salesman problem , bottleneck traveling salesman problem , lin–kernighan heuristic , 2 opt , mathematical optimization , traveling purchaser problem , christofides algorithm , computer science , mathematics
A Note on "The Formulation of the M-Salesman Traveling Salesman Problem" (Svestka, J. A., V. E. Huckfeldt. 1973. Computational experience with an M-salesman traveling salesman algorithm. Management Sci. 19 (7, March) 790-799).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom