OOIR: Observatory of International Research

Papers

(The TQCC of Mathematical Methods 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-03-01 to 2025-03-01.)

Article	Citations
On the unification of centralized and decentralized clearing mechanisms in financial networks	22
Convergence rate of LQG mean field games with common noise	13
Optimal renewable resource harvesting model using price and biomass stochastic variations: a utility based approach	8
2021 MMOR best paper award	6
2023 MMOR best paper award	6
Stochastic comparisons and ageing properties of residual lifetime mixture models	5
Facets of the cone of exact games	5
Analysis of a two-class queueing system with service times dependent on the presence of a certain class	5
Optimal investments for the standard maximization problem with non-concave utility function in complete market model	5
Robust classical-impulse stochastic control problems in an infinite horizon	5
Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables	5
Chance-constrained games with mixture distributions	5
Refined cut selection for benders decomposition: applied to network capacity expansion problems	5
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems	5
Editorial	4
Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem	4
Solving continuous set covering problems by means of semi-infinite optimization	4
Optimal three-part tariff pricing with Spence-Mirrlees reservation prices	4
Dynamic pricing with finite price sets: a non-parametric approach	4
Strong duality for standard convex programs	4
A fragile multi-CPR game	4
A test instance generator for multiobjective mixed-integer optimization	4
Nash equilibria in a class of Markov stopping games with total reward criterion	4
An SDP-based approach for computing the stability number of a graph	4
Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover	3

Minimizing spectral risk measures applied to Markov decision processes	3
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints	3
A singular stochastic control problem with direction switching cost	3
Average monotonic cooperative games with nontransferable utility	3
Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising	3
Contractive approximations in average Markov decision chains driven by a risk-seeking controller	3
A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function	3
On the solution of monotone nested variational inequalities	3
The α-Egalitarian Myerson value of games with communication structure	3
Binary programming formulations for the upper domination problem	3
Optimal stopping and impulse control in the presence of an anticipated regime switch	3
Column generation based solution for bi-objective gate assignment problems	2
Stochastic Gauss–Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks	2
A new value for communication situations	2
Nash equilibria for relative investors via no-arbitrage arguments	2
Exploiting complete linear descriptions for decentralized power market problems with integralities	2
Priority coalitional games and claims problems	2
Strong convergence results for quasimonotone variational inequalities	2
Combining discrete and continuous information for multi-criteria optimization problems	2
2022 MMOR best paper award	2
Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs	2
On asset pricing in a binomial model with fixed and proportional transaction costs, portfolio constraints and dividends	2
Optimal step length for the Newton method: case of self-concordant functions	2