Computers & Operations 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-05-01 to 2025-05-01.)
ArticleCitations
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment426
Novel mathematical formulations for parallel-batching processing machine scheduling problems125
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination102
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes102
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system91
Minimizing maximum tardiness on a single machine with family setup times and machine disruption84
Multi-objective shipment consolidation and dispatching problem76
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage72
Time window optimization for attended home service delivery under multiple sources of uncertainties72
Editorial Board71
Sequential customers’ decisions in facility location with comparison-shopping68
Editorial Board65
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]60
VNSMAS: A constraint-based portfolio profit maximization57
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach57
Stochastic production routing problem for perishable products: Modeling and a solution algorithm55
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows54
A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem53
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search52
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation49
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm49
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling49
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem49
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation48
On some lower bounds for the permutation flowshop problem48
Optimizing price, order quantity, and backordering level using a nonlinear holding cost and a power demand pattern48
Arc routing with trip-balancing and attractiveness measures — A waste collection case study48
Collaborative optimization of last-train timetables for metro network to increase service time for passengers47
Integrated packing and routing: A model and its solutions47
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand47
Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization: A case study on permutation flow-shop scheduling problem46
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems46
An ALNS metaheuristic for the family multiple traveling salesman problem44
Decentralized online integer programming problems with a coupling cardinality constraint43
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption43
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem43
Stochastic inventory routing with dynamic demands and intra-day depletion43
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem41
A risk index model for uncertain portfolio selection with background risk41
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems41
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem40
0.057036161422729