Computers & Operations Research

Papers
(The H4-Index of Computers & Operations Research is 41. 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-08-01 to 2026-08-01.)
ArticleCitations
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation187
A Bi-criterion Steiner Traveling Salesperson Problem with Time Windows for Last-mile Electric Vehicle Logistics136
Multi-objective shipment consolidation and dispatching problem123
New lower bounds on the cutwidth of graphs107
Editorial Board102
A matheuristic approach for the multi-manned assembly line balancing problem with collaborative robots101
VNSMAS: A constraint-based portfolio profit maximization92
Editorial Board87
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows86
Multi-commodity vehicle routing problem with pickup and delivery for electric micromobility devices rebalancing and battery swapping85
A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage82
On some lower bounds for the permutation flowshop problem78
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation78
Energy-Efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring66
Sequential customers’ decisions in facility location with comparison-shopping65
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling64
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search63
Time window optimization for attended home service delivery under multiple sources of uncertainties61
Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand60
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination57
A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem56
Using machine learning to identify hidden constraints in vehicle routing problems53
Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization53
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems50
Collaborative optimization of last-train timetables for metro network to increase service time for passengers50
A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system50
Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach48
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm48
Models and algorithms for configuring and testing prototype cars47
Arc routing with trip-balancing and attractiveness measures — A waste collection case study47
Integrated packing and routing: A model and its solutions47
Novel mathematical formulations for parallel-batching processing machine scheduling problems47
Learning-based TSP-solvers tend to be overly greedy46
Adjustable robust positive influence dominating set with partial payment46
The pollution-routing problem with speed optimization and uneven topography44
Multi-Attribute Utility Deep Reinforcement Learning method for Sequential Multi-Criteria Decision problems: Application to human resource planning44
An ALNS metaheuristic for the family multiple traveling salesman problem44
Feature and functional form selection in additive models via mixed-integer optimization44
Editorial Board42
A genetic algorithm to solve the production lot-sizing problem with capacity adjustment42
A hub-and-spoke network design for relocating emergency service vehicles42
Stochastic inventory routing with dynamic demands and intra-day depletion41
A graph theoretic approach to non-anticipativity constraint generation in multistage stochastic programs with incomplete scenario sets41
High quality timetables for Italian schools41
Variants of Harsanyi’s tracing procedures for selecting a perfect stationary equilibrium in stochastic games41
0.14066505432129