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

Article	Citations
Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization	236
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation	176
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment	124
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation	114
A Bi-criterion Steiner Traveling Salesperson Problem with Time Windows for Last-mile Electric Vehicle Logistics	103
Multi-objective shipment consolidation and dispatching problem	97
Editorial Board	91
New lower bounds on the cutwidth of graphs	91
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling	83
A matheuristic approach for the multi-manned assembly line balancing problem with collaborative robots	81
Using machine learning to identify hidden constraints in vehicle routing problems	74
Energy-Efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring	74
Sequential customers’ decisions in facility location with comparison-shopping	72
Collaborative optimization of last-train timetables for metro network to increase service time for passengers	71
Arc routing with trip-balancing and attractiveness measures — A waste collection case study	68
Stochastic production routing problem for perishable products: Modeling and a solution algorithm	61
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach	57
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes	57
Integrated packing and routing: A model and its solutions	57
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage	57
Time window optimization for attended home service delivery under multiple sources of uncertainties	57
On some lower bounds for the permutation flowshop problem	55
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems	54
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search	54
Editorial Board	51

A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem	49
Novel mathematical formulations for parallel-batching processing machine scheduling problems	46
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows	45
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination	45
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system	44
Multi-commodity vehicle routing problem with pickup and delivery for electric micromobility devices rebalancing and battery swapping	44
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm	44
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand	43
VNSMAS: A constraint-based portfolio profit maximization	43
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints	42
Sustainable risk mitigation in hazardous material transportation	42
Adjustable robust positive influence dominating set with partial payment	41
Scheduling jobs with shared additional operations on parallel identical machines	41
Models and algorithms for configuring and testing prototype cars	41
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem	41
Optimizing strategic and operational decisions of car sharing systems under demand uncertainty and substitution	40
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption	40