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 2022-01-01 to 2026-01-01.)

Article	Citations
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]	193
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment	153
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand	151
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows	126
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation	113
A Bi-criterion Steiner Traveling Salesperson Problem with Time Windows for Last-mile Electric Vehicle Logistics	104
Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization	85
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes	85
Using machine learning to identify hidden constraints in vehicle routing problems	83
VNSMAS: A constraint-based portfolio profit maximization	78
Multi-objective shipment consolidation and dispatching problem	75
New lower bounds on the cutwidth of graphs	74
Editorial Board	73
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation	66
Energy-Efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring	65
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling	64
On some lower bounds for the permutation flowshop problem	58
Arc routing with trip-balancing and attractiveness measures — A waste collection case study	55
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems	55
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination	54
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage	54
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system	52
Novel mathematical formulations for parallel-batching processing machine scheduling problems	49
Stochastic production routing problem for perishable products: Modeling and a solution algorithm	48
Collaborative optimization of last-train timetables for metro network to increase service time for passengers	48

Integrated packing and routing: A model and its solutions	48
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach	47
Time window optimization for attended home service delivery under multiple sources of uncertainties	47
Sequential customers’ decisions in facility location with comparison-shopping	47
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm	44
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search	44
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption	43
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems	43
Stochastic inventory routing with dynamic demands and intra-day depletion	42
Metaheuristics for the bi-objective resource-constrained project scheduling problem with time-dependent resource costs: An experimental comparison	42
Solving weighted Maximum Satisfiability with Branch and Bound and clause learning	41
The pollution-routing problem with speed optimization and uneven topography	41
Sustainable risk mitigation in hazardous material transportation	41
Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption	40
Project scheduling cost optimization based on resource transfer costs and robustness	39
Meta-learning for dynamic multi-robot task scheduling	39
A genetic algorithm to solve the production lot-sizing problem with capacity adjustment	39