Open Access Helper

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:

Ants can orienteer a thief in their robbery
Jonatas B. C. Chagas, Markus Wagner
Operations Research Letters (2020) Vol. 48, Iss. 6, pp. 708-714
Open Access | Times Cited: 12

Showing 12 citing articles:

Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm
Shatha Abdulhadi Muthana, Ku Ruhana Ku‐Mahamud
Journal of Information and Communication Technology (2023) Vol. 22
Open Access | Times Cited: 5
Algorithms for the Thief Orienteering Problem on Directed Acyclic Graphs
Andrew Bloch-Hansen, Roberto Solis-Oba, Daniel R. Page
Theoretical Computer Science (2024) Vol. 1023, pp. 114900-114900
Closed Access | Times Cited: 1
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach
Jonatas B. C. Chagas, Markus Wagner
Optimization Letters (2021) Vol. 16, Iss. 8, pp. 2313-2331
Closed Access | Times Cited: 10
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba
Lecture notes in computer science (2023), pp. 87-98
Closed Access | Times Cited: 2
The Thief Orienteering Problem on Series-Parallel Graphs
Andrew Bloch-Hansen, Roberto Solis-Oba
Lecture notes in computer science (2024), pp. 248-262
Closed Access
Travelling thief problem: a survey of recent variants, solution approaches and future directions
Tamalika Sarkar, Chandrasekharan Rajendran
International Journal of Systems Science Operations & Logistics (2024) Vol. 11, Iss. 1
Closed Access
The Thief Orienteering Problem on Series-Parallel Graphs
Andrew Bloch-Hansen, Roberto Solis-Oba
Research Square (Research Square) (2024)
Open Access
Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimers
Hirad Assimi, Ben Koch, Chris Garcia, et al.
Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing (2022), pp. 1074-1083
Open Access | Times Cited: 1
Self-Adaptive Ant System with Hierarchical Clustering for the Thief Orienteering Problem
Vu Huynh, The Viet Le, Ngoc Hoang Luong
(2023), pp. 723-730
Closed Access
Abordagens Heurísticas Aplicadas ao Thief Orienteering Problem
Leonardo Moreira Faêda
(2022)
Open Access
Modelling and optimization of run-of-mine stockpile recovery
Hirad Assimi, Ben Koch, Chris Garcia, et al.
(2021), pp. 450-458
Closed Access
Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
Jonatas B. C. Chagas, Markus Wagner
arXiv (Cornell University) (2021)
Closed Access
Page 1

Scroll to top