OOIR: Observatory of International Research

Papers

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

Article	Citations
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]	179
Arc routing with trip-balancing and attractiveness measures — A waste collection case study	145
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination	145
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation	122
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows	103
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation	94
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach	82
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem	78
Stochastic production routing problem for perishable products: Modeling and a solution algorithm	78
On some lower bounds for the permutation flowshop problem	75
Collaborative optimization of last-train timetables for metro network to increase service time for passengers	73
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes	72
VNSMAS: A constraint-based portfolio profit maximization	67
Multi-objective shipment consolidation and dispatching problem	66
Integrated packing and routing: A model and its solutions	66
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage	64
New lower bounds on the cutwidth of graphs	63
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling	59
Editorial Board	59
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search	55
Energy-Efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring	55
Using machine learning to identify hidden constraints in vehicle routing problems	53
Sequential customers’ decisions in facility location with comparison-shopping	53
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment	53
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system	50

Novel mathematical formulations for parallel-batching processing machine scheduling problems	50
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand	50
Time window optimization for attended home service delivery under multiple sources of uncertainties	47
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems	46
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm	46
Scheduling jobs with shared additional operations on parallel identical machines	45
A genetic algorithm to solve the production lot-sizing problem with capacity adjustment	45
Models and algorithms for configuring and testing prototype cars	45
Meta-learning for dynamic multi-robot task scheduling	44
Dynamic inventory control and pricing strategies for perishable products considering both profit and waste	44
Decentralized online integer programming problems with a coupling cardinality constraint	44
Two-stage robust optimization for public health emergency project scheduling with uncertain activity durations	43
The team orienteering problem with service times and mandatory & incompatible nodes	42
Variants of Harsanyi’s tracing procedures for selecting a perfect stationary equilibrium in stochastic games	42
Dynamic programming in inventory management: A review	41
Solving weighted Maximum Satisfiability with Branch and Bound and clause learning	41
An ALNS metaheuristic for the family multiple traveling salesman problem	41