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:

Stochastic local search for Partial Max-SAT: an experimental evaluation
Haifa Hamad Alkasem, Mohamed El Bachir Menaï
Artificial Intelligence Review (2020) Vol. 54, Iss. 4, pp. 2525-2566
Closed Access | Times Cited: 10

Showing 10 citing articles:

A cerebellar operant conditioning-inspired constraint satisfaction approach for product design concept generation
Mingdong Li, Shanhe Lou, Yicong Gao, et al.
International Journal of Production Research (2022) Vol. 61, Iss. 17, pp. 5822-5841
Closed Access | Times Cited: 9
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability
Huimin Fu, Yang Xu, Guanfeng Wu, et al.
Information Sciences (2021) Vol. 566, pp. 118-139
Open Access | Times Cited: 9
Learning from survey propagation: a neural network for MAX-E-3-SAT
Raffaele Marino
Machine Learning Science and Technology (2021) Vol. 2, Iss. 3, pp. 035032-035032
Open Access | Times Cited: 9
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation
Ghassan Ahmed Alı, Hamza Abubakar, Shehab Abdulhabib Alzaeemi, et al.
PLoS ONE (2023) Vol. 18, Iss. 9, pp. e0286874-e0286874
Open Access | Times Cited: 3
Towards efficient local search for the minimum total dominating set problem
Shuli Hu, Huan Liu, Yupan Wang, et al.
Applied Intelligence (2021) Vol. 51, Iss. 12, pp. 8753-8767
Closed Access | Times Cited: 7
A dynamic bidirectional heuristic trust path search algorithm
Jiaying Che, Xiangrong Tong, Lei Yu
CAAI Transactions on Intelligence Technology (2022) Vol. 7, Iss. 3, pp. 340-353
Open Access | Times Cited: 3
Quantifying Grover speed-ups beyond asymptotic analysis
Chris Cade, Marten Folkertsma, Ido Niesen, et al.
Quantum (2023) Vol. 7, pp. 1133-1133
Open Access | Times Cited: 1
ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
Ping Guo, Yang Zhang
Applied Intelligence (2021) Vol. 52, Iss. 2, pp. 1740-1751
Closed Access | Times Cited: 3
Improving two-mode algorithm via probabilistic selection for solving satisfiability problem
Huimin Fu, Shaowei Cai, Guanfeng Wu, et al.
Information Sciences (2023) Vol. 653, pp. 119751-119751
Closed Access
Quantifying Grover speed-ups beyond asymptotic analysis
Chris Cade, Marten Folkertsma, Ido Niesen, et al.
arXiv (Cornell University) (2022)
Open Access
Page 1

Scroll to top