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-09-01 to 2025-09-01.)
ArticleCitations
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search467
Editorial Board164
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]129
Arc routing with trip-balancing and attractiveness measures — A waste collection case study127
Using machine learning to identify hidden constraints in vehicle routing problems111
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems91
VNSMAS: A constraint-based portfolio profit maximization87
Integrated packing and routing: A model and its solutions79
Multi-objective shipment consolidation and dispatching problem77
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage72
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows68
On some lower bounds for the permutation flowshop problem66
Time window optimization for attended home service delivery under multiple sources of uncertainties64
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment62
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach58
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand57
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes57
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation56
Stochastic production routing problem for perishable products: Modeling and a solution algorithm54
Optimizing price, order quantity, and backordering level using a nonlinear holding cost and a power demand pattern52
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination52
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation51
Novel mathematical formulations for parallel-batching processing machine scheduling problems51
Sequential customers’ decisions in facility location with comparison-shopping51
Collaborative optimization of last-train timetables for metro network to increase service time for passengers51
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system50
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling50
Decentralized online integer programming problems with a coupling cardinality constraint48
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm48
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem48
Stochastic inventory routing with dynamic demands and intra-day depletion46
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems45
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem44
Dynamic inventory control and pricing strategies for perishable products considering both profit and waste43
A genetic algorithm to solve the production lot-sizing problem with capacity adjustment43
Scheduling jobs with shared additional operations on parallel identical machines42
Models and algorithms for configuring and testing prototype cars41
The integrated on-demand bus routing problem: Combining on-demand buses with a high-frequency fixed line public transport network41
High quality timetables for Italian schools41
A graph theoretic approach to non-anticipativity constraint generation in multistage stochastic programs with incomplete scenario sets41
Metaheuristics for the bi-objective resource-constrained project scheduling problem with time-dependent resource costs: An experimental comparison40
Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations40
Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption40
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption40
0.099766969680786