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:

Partial evaluation in Rank Aggregation Problems
Juan A. Aledo, José A. Gámez, Alejandro Rosete Suárez
Computers & Operations Research (2016) Vol. 78, pp. 299-304
Closed Access | Times Cited: 13

Showing 13 citing articles:

An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
Masood Fathi, Amir Nourmohammadi, Amos H.C. Ng, et al.
Engineering Computations (2019) Vol. 37, Iss. 2, pp. 501-521
Open Access | Times Cited: 30
A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
Antonio D’Ambrosio, Giulio Mazzeo, Carmela Iorio, et al.
Computers & Operations Research (2017) Vol. 82, pp. 126-138
Closed Access | Times Cited: 32
Median constrained bucket order rank aggregation
Antonio D’Ambrosio, Carmela Iorio, Michele Staiano, et al.
Computational Statistics (2019) Vol. 34, Iss. 2, pp. 787-802
Closed Access | Times Cited: 17
Ensemble framework for causality learning with heterogeneous Directed Acyclic Graphs through the lens of optimization
Babak Aslani, Shima Mohebbi
Computers & Operations Research (2023) Vol. 152, pp. 106148-106148
Closed Access | Times Cited: 5
Scheduling interrelated activities in complex projects under high-order rework: A DSM-based approach
Muchen Wen, Jun Lin, Yanjun Qian, et al.
Computers & Operations Research (2021) Vol. 130, pp. 105246-105246
Closed Access | Times Cited: 8
A data-driven matching algorithm for ride pooling problem
Ahmet Şahin, İsmail Sevim, Erinç Albey, et al.
Computers & Operations Research (2021) Vol. 140, pp. 105666-105666
Closed Access | Times Cited: 8
Algorithm 989
Ekhiñe Irurozki, Josu Ceberio, Josean Santamaria, et al.
ACM Transactions on Mathematical Software (2018) Vol. 44, Iss. 4, pp. 1-13
Open Access | Times Cited: 8
Block-insertion-based algorithms for the linear ordering problem
Yanjun Qian, Jun Lin, Dehong Li, et al.
Computers & Operations Research (2019) Vol. 115, pp. 104861-104861
Closed Access | Times Cited: 6
A partial evaluation approach for the School Bus Routing Problem
Ana Camila Pérez, Eduardo Sánchez-Ansola, Alejandro Rosete Suárez, et al.
Heliyon (2022) Vol. 8, Iss. 4, pp. e09291-e09291
Open Access | Times Cited: 4
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems
Sina Akbari, Adolfo R. Escobedo
Computers & Operations Research (2023) Vol. 153, pp. 106164-106164
Open Access | Times Cited: 1
Heuristic Search for Rank Aggregation with Application to Label Ranking
Yangming Zhou, Jin‐Kao Hao, Zhen Li
INFORMS journal on computing (2023) Vol. 36, Iss. 2, pp. 308-326
Open Access | Times Cited: 1
Partial Evaluation and Efficient Discarding for the Maximal Covering Location Problem
Cynthia Porras, Jenny Fajardo Calderín, Alejandro Rosete Suárez, et al.
IEEE Access (2021) Vol. 9, pp. 20542-20556
Closed Access | Times Cited: 2
The Bradly-Terry Regression Trunk approach for modelling preference data with small trees
Alessio Baldassarre, Elise Dusseldorp, Antonio D’Ambrosio, et al.
arXiv (Cornell University) (2021)
Open Access
Page 1

Scroll to top