OOIR: Observatory of International Research

Papers

(The H4-Index of Computers & Operations Research is 39. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-06-01 to 2025-06-01.)

Article	Citations
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes	440
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system	136
Editorial Board	108
Editorial Board	106
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]	93
Arc routing with trip-balancing and attractiveness measures — A waste collection case study	82
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search	76
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation	73
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination	73
VNSMAS: A constraint-based portfolio profit maximization	72
Integrated packing and routing: A model and its solutions	68
Multi-objective shipment consolidation and dispatching problem	60
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage	59
Collaborative optimization of last-train timetables for metro network to increase service time for passengers	56
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows	55
Time window optimization for attended home service delivery under multiple sources of uncertainties	54
On some lower bounds for the permutation flowshop problem	54
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment	53
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach	51
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem	50
A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem	50
Optimizing price, order quantity, and backordering level using a nonlinear holding cost and a power demand pattern	49
Novel mathematical formulations for parallel-batching processing machine scheduling problems	49
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems	49
Energy-Efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring	49

Sequential customers’ decisions in facility location with comparison-shopping	48
Stochastic production routing problem for perishable products: Modeling and a solution algorithm	48
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand	48
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm	47
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation	46
Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization: A case study on permutation flow-shop scheduling problem	45
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling	45
Decentralized online integer programming problems with a coupling cardinality constraint	44
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption	43
Stochastic inventory routing with dynamic demands and intra-day depletion	43
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems	43
A risk index model for uncertain portfolio selection with background risk	42
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem	40
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem	40
Managing hospital inpatient beds under clustered overflow configuration	39