OOIR: Observatory of International Research

Papers

(The H4-Index of Computers & Operations Research is 40. 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-12-01 to 2025-12-01.)

Article	Citations
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]	184
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment	148
Using machine learning to identify hidden constraints in vehicle routing problems	146
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand	124
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows	110
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation	98
Energy-Efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring	82
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes	80
Stochastic production routing problem for perishable products: Modeling and a solution algorithm	79
VNSMAS: A constraint-based portfolio profit maximization	77
Multi-objective shipment consolidation and dispatching problem	74
New lower bounds on the cutwidth of graphs	70
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage	70
Editorial Board	69
Sequential customers’ decisions in facility location with comparison-shopping	65
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation	64
Novel mathematical formulations for parallel-batching processing machine scheduling problems	63
On some lower bounds for the permutation flowshop problem	57
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach	54
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling	54
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system	54
Time window optimization for attended home service delivery under multiple sources of uncertainties	51
Integrated packing and routing: A model and its solutions	51
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems	48
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination	47

Collaborative optimization of last-train timetables for metro network to increase service time for passengers	47
Arc routing with trip-balancing and attractiveness measures — A waste collection case study	47
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm	46
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem	46
Scheduling jobs with shared additional operations on parallel identical machines	45
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search	45
Models and algorithms for configuring and testing prototype cars	44
Meta-learning for dynamic multi-robot task scheduling	44
Dynamic inventory control and pricing strategies for perishable products considering both profit and waste	44
The integrated on-demand bus routing problem: Combining on-demand buses with a high-frequency fixed line public transport network	43
Variants of Harsanyi’s tracing procedures for selecting a perfect stationary equilibrium in stochastic games	42
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server	41
The team orienteering problem with service times and mandatory & incompatible nodes	41
Feature and functional form selection in additive models via mixed-integer optimization	41
Dynamic programming in inventory management: A review	41
Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations	40