4OR-A Quarterly Journal of Operations Research

Papers
(The TQCC of 4OR-A Quarterly Journal of Operations Research is 3. 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 2020-03-01 to 2024-03-01.)
ArticleCitations
Vehicle routing problems over time: a survey54
Modified forward–backward splitting method for variational inclusions21
Mathematical programming formulations for the alternating current optimal power flow problem18
Challenges and opportunities in crowdsourced delivery planning and operations17
Matheuristics: using mathematics for heuristic design14
Home health care routing and scheduling problems: a literature review13
A comparison of penalty shootout designs in soccer13
A periodic review policy for a coordinated single vendor-multiple buyers supply chain with controllable lead time and distribution-free approach10
The trouble with the second quantifier9
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods9
Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints9
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange9
Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints7
A note: flowshop scheduling with linear deterioration and job-rejection7
Bridging the user equilibrium and the system optimum in static traffic assignment: a review7
A dominance-based rough set approach applied to evaluate the credit risk of sovereign bonds6
A gap in scientific reporting5
A bilevel optimization model for the newsvendor problem with the focus theory of choice5
A binary search algorithm for the general coupled task scheduling problem5
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem5
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop4
Multiple criteria sorting models and methods—Part I: survey of the literature4
Pricing and strategy selection in a closed-loop supply chain under demand and return rate uncertainty4
Preference elicitation for a ranking method based on multiple reference profiles4
Mixed integer programming formulations for the generalized traveling salesman problem with time windows4
Using the power of ideal solutions: simple proofs of some old and new results in location theory3
Inductive linearization for binary quadratic programs with linear constraints3
A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service3
A theoretical look at Electre Tri-nB and related sorting models3
Simple ranking method using reference profiles: incremental elicitation of the preference parameters3
An alternate approach to solve two-level hierarchical time minimization transportation problem3
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost3
0.027460098266602