Mathematical Methods of Operations Research

Papers
(The median citation count of Mathematical Methods 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 2021-03-01 to 2025-03-01.)
ArticleCitations
On the unification of centralized and decentralized clearing mechanisms in financial networks22
Convergence rate of LQG mean field games with common noise13
Optimal renewable resource harvesting model using price and biomass stochastic variations: a utility based approach8
2023 MMOR best paper award6
2021 MMOR best paper award6
Stochastic comparisons and ageing properties of residual lifetime mixture models5
Facets of the cone of exact games5
Analysis of a two-class queueing system with service times dependent on the presence of a certain class5
Optimal investments for the standard maximization problem with non-concave utility function in complete market model5
Robust classical-impulse stochastic control problems in an infinite horizon5
Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables5
Chance-constrained games with mixture distributions5
Refined cut selection for benders decomposition: applied to network capacity expansion problems5
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems5
Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem4
Solving continuous set covering problems by means of semi-infinite optimization4
Optimal three-part tariff pricing with Spence-Mirrlees reservation prices4
Dynamic pricing with finite price sets: a non-parametric approach4
Strong duality for standard convex programs4
A fragile multi-CPR game4
A test instance generator for multiobjective mixed-integer optimization4
Nash equilibria in a class of Markov stopping games with total reward criterion4
An SDP-based approach for computing the stability number of a graph4
Editorial4
Average monotonic cooperative games with nontransferable utility3
Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising3
Contractive approximations in average Markov decision chains driven by a risk-seeking controller3
A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function3
On the solution of monotone nested variational inequalities3
The α-Egalitarian Myerson value of games with communication structure3
Binary programming formulations for the upper domination problem3
Optimal stopping and impulse control in the presence of an anticipated regime switch3
Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover3
Minimizing spectral risk measures applied to Markov decision processes3
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints3
A singular stochastic control problem with direction switching cost3
Stochastic Gauss–Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks2
A new value for communication situations2
Nash equilibria for relative investors via no-arbitrage arguments2
Exploiting complete linear descriptions for decentralized power market problems with integralities2
Priority coalitional games and claims problems2
Strong convergence results for quasimonotone variational inequalities2
Combining discrete and continuous information for multi-criteria optimization problems2
2022 MMOR best paper award2
Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs2
On asset pricing in a binomial model with fixed and proportional transaction costs, portfolio constraints and dividends2
Optimal step length for the Newton method: case of self-concordant functions2
Column generation based solution for bi-objective gate assignment problems2
How to project onto the intersection of a closed affine subspace and a hyperplane1
An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems1
Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization1
The Lagrangian, constraint qualifications and economics1
A bilevel optimization approach to decide the feasibility of bookings in the European gas market1
Testing indexability and computing Whittle and Gittins index in subcubic time1
2020 MMOR best paper award1
Correction to: Computational analysis of GI[X] /D-MSP(a,b) /1 queueing system via RG-factorization1
An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems1
On proper separation of convex sets1
Reduced two-bound core games1
Efficient dual ADMMs for sparse compressive sensing MRI reconstruction1
The facets of the spanning trees polytope1
Markov risk mappings and risk-sensitive optimal prediction1
Discounted stochastic games for continuous-time jump processes with an uncountable state space1
Peer-to-Peer Lending: a Growth-Collapse Model and its Steady-State Analysis1
Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets1
Risk filtering and risk-averse control of Markovian systems subject to model uncertainty1
The non-preemptive ‘Join the Shortest Queue–Serve the Longest Queue’ service system with or without switch-over times1
Minimizing the penalized probability of drawdown for a general insurance company under ambiguity aversion1
Existence and computations of best affine strategies for multilevel reverse Stackelberg games1
An implicit gradient-descent procedure for minimax problems1
Optimal pairs trading with dynamic mean-variance objective1
An axiomatic approach to Markov decision processes1
Approximating multiobjective optimization problems: How exact can you be?1
Correction to: Optimal discrete search with technological choice1
Stochastic Mitra–Wan forestry models analyzed as a mean field optimal control problem1
0.12189817428589