4OR-A Quarterly Journal of Operations Research

Papers
(The TQCC of 4OR-A Quarterly Journal of Operations Research is 2. 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-02-01 to 2025-02-01.)
ArticleCitations
Optimization methods for knapsack and tool switching problems28
Patient referral strategy and cost sharing for a medical consortium26
Acknowledgement to referees23
Approximation issues of fractional knapsack with penalties: a note16
Approximating the chance-constrained capacitated vehicle routing problem with robust optimization11
An introduction to variational quantum algorithms for combinatorial optimization problems11
A note on batch scheduling on a two-machine flowshop with machine-dependent processing times11
A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle8
Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies–part I7
Matheuristics: using mathematics for heuristic design7
A multidimensional spatial model for preference representation in multi-criteria group decision aiding6
Moderate exponential-time algorithms for scheduling problems6
Multiple criteria sorting models and methods. Part II: theoretical results and general issues5
Inductive linearization for binary quadratic programs with linear constraints: a computational study5
Air transport network optimization: analysis and selection of new markets4
Heuristic algorithms for the online integrated optimisation of order picking and vehicle routing decisions4
Designing new metaheuristic implementations: from metaphors to automatic design4
Multi-neighborhood search for combinatorial optimization4
A bilevel optimization model for the newsvendor problem with the focus theory of choice4
Stakeholder involvement in decision making: the development of a mass participation tool3
Simple ranking method using reference profiles: incremental elicitation of the preference parameters3
An efficient heuristic search algorithm for discovering large Condorcet domains3
Multi-period distribution network problems with minimum commitment contracts3
Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer3
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost3
A note on the complexity of the bilevel bottleneck assignment problem3
A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service3
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem2
Comparing with Promethee: some new theoretical contributions2
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work2
A study on sequential minimal optimization methods for standard quadratic problems2
An improved algorithm for solving the Weber location problem2
Acknowledgement to referees2
Exploiting hypergraphs’ properties in binary polynomial optimization2
Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems2
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods2
Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint2
An iterative solution technique for capacitated two-stage time minimization transportation problem2
0.031069993972778