OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A branch and bound algorithm for the porbabilistic traveling salesman problem
Soumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna
(2015), pp. 1-6
Closed Access | Times Cited: 4

Showing 4 citing articles:

Two phase heuristic algorithm for the multiple-travelling salesman problem
Xiaolong Xu, Hao Yuan, Mark Liptrott, et al.
Soft Computing (2017) Vol. 22, Iss. 19, pp. 6567-6581
Open Access | Times Cited: 56

GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
Xiaolong Xu, Hao Yuan, Peter Matthew, et al.
Soft Computing (2019) Vol. 24, Iss. 10, pp. 7197-7210
Open Access | Times Cited: 9

Comparative analysis of different approaches to solve the job assignment problem
Mohit Manoj Vinchoo, Rugved Deolekar
2017 International Conference on Trends in Electronics and Informatics (ICEI) (2017), pp. 129-134
Closed Access | Times Cited: 3

An investigation of the robustness in the Travelling Salesman problem routes using special structured matrices
Azmin Azliza Aziz, Seyed Mohsen Mousavi, Madjid Tavana, et al.
International Journal of Systems Science Operations & Logistics (2018) Vol. 7, Iss. 2, pp. 172-181
Open Access | Times Cited: 3

Page 1

Scroll to top