OOIR: Observatory of International Research

Papers

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

Article	Citations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond	227
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds	175
On technical debt in mathematical programming: An exploratory study	21
Learning to use local cuts	20
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem	15
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems	14
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	14
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form	12
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming	11
Regularized step directions in nonlinear conjugate gradient methods	11
LMBOPT: a limited memory method for bound-constrained optimization	10
Computing minimum-volume enclosing ellipsoids	10
Multiparent path relinking. An application to the power dominating set problem	8
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem	8
Parallel and distributed asynchronous adaptive stochastic gradient methods	8
Correction to: Asynchronous Lagrangian scenario decomposition	7
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs	7
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization	7
Progressively strengthening and tuning MIP solvers for reoptimization	6
Structure-aware methods for expensive derivative-free nonsmooth composite optimization	6
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python	5
Nonlinear conjugate gradient for smooth convex functions	5
The smoothed duality gap as a stopping criterion	5
Adaptive sieving: a dimension reduction technique for sparse optimization problems	5
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	5

A hierarchy of spectral relaxations for polynomial optimization	4
Instance-specific linear relaxations of semidefinite optimization problems	4
A fix-propagate-repair heuristic for mixed integer programming	4
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	3
CDOpt: a Python package for a class of Riemannian optimization	3
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs	3
Convex mixed-integer optimization with Frank–Wolfe methods	3
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty	3
Feasibility Jump: an LP-free Lagrangian MIP heuristic	3
A computational study of perspective cuts	2
On O(n) algorithms for projection onto the top-k-sum sublevel set	2
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization	2
Efficient MIP techniques for computing the relaxation complexity	2
A new computational framework for log-concave density estimation	2
Political districting to minimize cut edges	2
Faster exact solution of sparse MaxCut and QUBO problems	2
A dynamic programming approach for generalized nearly isotonic optimization	2
Efficient algorithms for implementing incremental proximal-point methods	2
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem	2