Modified TANYAKUMU Labelling Method to Solve Equality Generalized Travelling Salesman Problem-Reference-Cited by-同舟云学术

Modified TANYAKUMU Labelling Method to Solve Equality Generalized Travelling Salesman Problem

Published:2022-10-21 Issue: Volume: Page:936-947
ISSN:2367-3370
Container-title:Intelligent Computing & Optimization
language:
Short-container-title:

Author:

Tawanda Trust,Nyamugure Philimon,Kumar Santosh,Munapo Elias

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-19958-5_88

Reference18 articles.

1. Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. J. Oper. Res. Soc. 47(12), 1461–1467 (1996)

2. Fischetti, M., González, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378–394 (1997). https://doi.org/10.1287/opre.45.3.378

3. Srivastava, S.S., Kumar, S., Garg, R.C., Sen, P.: Generalized traveling salesman problem through n sets of nodes. Can. Oper. Res. Soc. J. 7(2), 97–101 (1969)

4. Garg, R.C., Kumar, S., Dass, P., Sen, P.: Generalized travelling salesman problem through N sets of nodes in a competitive market. Planning forschung, Band II, Helf 2, 116–120 (1970)

5. Munapo, E.: A network branch and bound approach for the travelling salesman model. South Afr. J. Econ. Manag. Sci. 16(1), 52–63 (2013)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extended TANYAKUMU Labelling Method to Compute Shortest Paths in Directed Networks;International Journal of Mathematical, Engineering and Management Sciences;2023-10-01