4OR-A Quarterly Journal of Operations Research

Papers
(The median citation count of 4OR-A Quarterly Journal of Operations Research is 1. 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-11-01 to 2024-11-01.)
ArticleCitations
Challenges and opportunities in crowdsourced delivery planning and operations26
Matheuristics: using mathematics for heuristic design24
Home health care routing and scheduling problems: a literature review23
Frank–Wolfe and friends: a journey into projection-free first-order optimization methods16
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange12
Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints11
Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints11
Bridging the user equilibrium and the system optimum in static traffic assignment: a review11
The trouble with the second quantifier11
A dominance-based rough set approach applied to evaluate the credit risk of sovereign bonds8
Multiple criteria sorting models and methods—Part I: survey of the literature8
A gap in scientific reporting7
A bilevel optimization model for the newsvendor problem with the focus theory of choice6
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem6
An alternate approach to solve two-level hierarchical time minimization transportation problem5
An introduction to variational quantum algorithms for combinatorial optimization problems5
Preference elicitation for a ranking method based on multiple reference profiles5
A study of connectivity on dynamic graphs: computing persistent connected components5
A binary search algorithm for the general coupled task scheduling problem5
A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service4
Cross Malmquist Productivity Index in Data Envelopment Analysis4
Multiple criteria sorting models and methods. Part II: theoretical results and general issues4
Simple ranking method using reference profiles: incremental elicitation of the preference parameters4
A theoretical look at Electre Tri-nB and related sorting models4
The grid based approach, a fast local evaluation technique for line planning3
An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times3
A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle3
A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference3
An iterative solution technique for capacitated two-stage time minimization transportation problem3
Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies–part I3
Partition-based distributionally robust optimization via optimal transport with order cone constraints3
Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems3
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost3
A survey of attended home delivery and service problems with a focus on applications2
Teaching OR: automatic evaluation for linear programming modelling2
A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization2
Moderate exponential-time algorithms for scheduling problems2
Retailer’s optimal CSR investment in closed-loop supply chains: the impacts of supply chain structure and channel power structure2
Controlling the emotional expressiveness of synthetic speech: a deep learning approach2
A note on ELECTRE TRI-nB with few limiting profiles2
Optimization methods for knapsack and tool switching problems2
Measures of balance in combinatorial optimization2
4OR comes of age2
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem2
A note on the integrality gap of cutting and skiving stock instances2
A study on sequential minimal optimization methods for standard quadratic problems1
Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer1
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective1
Critical node/edge detection problems on trees1
Minimization of maximum lateness on parallel machines with a single server and job release dates1
A two-objective optimization of ship itineraries for a cruise company1
Customer joining strategies in Markovian queues with B-limited service rule and multiple vacations1
An improved algorithm for solving the Weber location problem1
Inductive linearization for binary quadratic programs with linear constraints: a computational study1
Approximation issues of fractional knapsack with penalties: a note1
Contributions of Inclusion-Exclusion to exact or approximate solution of scheduling problems1
An improved decision support model for scheduling production in an engineer-to-order manufacturer1
A multiple criteria socio-technical approach for the Portuguese Army Special Forces recruitment1
On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency1
A new self-scaling memoryless quasi-Newton update for unconstrained optimization1
Stakeholder involvement in decision making: the development of a mass participation tool1
Approximating the chance-constrained capacitated vehicle routing problem with robust optimization1
Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies—part II1
Dealing with uncertainty in round robin sports scheduling1
Time-locked free trial strategy in duopoly markets with switching costs1
Integrated optimization and decision support systems for attended home delivery and service problems1
0.067507982254028