OOIR: Observatory of International Research

Papers

(The median citation count of Mathematical Programming Computation 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-04-01 to 2025-04-01.)

Article	Citations
Parallel and distributed asynchronous adaptive stochastic gradient methods	197
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price	129
Solving clustered low-rank semidefinite programs arising from polynomial optimization	32
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect	19
Efficient MIP techniques for computing the relaxation complexity	13
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization	12
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs	11
Efficient algorithms for implementing incremental proximal-point methods	10
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem	9
A memetic procedure for global multi-objective optimization	8
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds	8
Feasibility Jump: an LP-free Lagrangian MIP heuristic	8
On technical debt in mathematical programming: An exploratory study	7
Local elimination in the traveling salesman problem	6
Deterministic global optimization with Gaussian processes embedded	6
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem	6
A fix-propagate-repair heuristic for mixed integer programming	5
CDOpt: a Python package for a class of Riemannian optimization	5
A branch and bound algorithm for robust binary optimization with budget uncertainty	5
Adaptive large neighborhood search for mixed integer programming	5
Faster exact solution of sparse MaxCut and QUBO problems	4
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems	4
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem	4
Learning to use local cuts	4
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems	3

Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization	3
Structure-aware methods for expensive derivative-free nonsmooth composite optimization	3
Effective matrix adaptation strategy for noisy derivative-free optimization	2
LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization	2
Allocation of fungible resources via a fast, scalable price discovery method	2
Progressively strengthening and tuning MIP solvers for reoptimization	2
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	2
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form	2
Correction to: Asynchronous Lagrangian scenario decomposition	2
Self-adaptive ADMM for semi-strongly convex problems	2
On O(n) algorithms for projection onto the top-k-sum sublevel set	2
Solving higher dimensional expensive black box global optimization problems using sparse directional search on surrogates	1
On the B-differential of the componentwise minimum of two affine vector functions	1
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	1
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty	1
Nonlinear conjugate gradient for smooth convex functions	1
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations	1
The MIP Workshop 2023 Computational Competition on reoptimization	1
A data driven Dantzig–Wolfe decomposition framework	1