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-08-01 to 2025-08-01.)
ArticleCitations
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system459
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search157
Editorial Board122
Novel mathematical formulations for parallel-batching processing machine scheduling problems122
Addendum to “FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming” [Comput. Oper. Res. 112 (2019) 104760]104
Sequential customers’ decisions in facility location with comparison-shopping89
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems85
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation78
Arc routing with trip-balancing and attractiveness measures — A waste collection case study76
Using machine learning to identify hidden constraints in vehicle routing problems72
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling67
VNSMAS: A constraint-based portfolio profit maximization63
Integrated packing and routing: A model and its solutions62
Multi-objective shipment consolidation and dispatching problem61
Collaborative optimization of last-train timetables for metro network to increase service time for passengers60
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage60
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows54
On some lower bounds for the permutation flowshop problem53
Time window optimization for attended home service delivery under multiple sources of uncertainties52
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment52
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand51
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes51
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach51
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation50
Optimizing price, order quantity, and backordering level using a nonlinear holding cost and a power demand pattern50
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm50
Stochastic production routing problem for perishable products: Modeling and a solution algorithm50
Decentralized online integer programming problems with a coupling cardinality constraint48
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem48
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination48
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems47
Stochastic inventory routing with dynamic demands and intra-day depletion47
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem46
Optimizing strategic and operational decisions of car sharing systems under demand uncertainty and substitution45
Intra-facility equity in discrete and continuous p-facility locati44
A genetic algorithm to solve the production lot-sizing problem with capacity adjustment43
Models and algorithms for configuring and testing prototype cars42
Scheduling jobs with shared additional operations on parallel identical machines42
High quality timetables for Italian schools40
A graph theoretic approach to non-anticipativity constraint generation in multistage stochastic programs with incomplete scenario sets40
0.034552097320557