OOIR: Observatory of International Research

Papers

(The TQCC of Mathematical Programming Computation is 5. 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 2022-06-01 to 2026-06-01.)

Article	Citations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond	294
Clarabel: An interior-point solver for conic programs with quadratic objectives	33
Learning to use local cuts	25
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem	23
On technical debt in mathematical programming: An exploratory study	22
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds	15
Accelerated nested proximal gradient algorithm for structured sparse optimization with capped-$$\ell _1$$ penalty	14
Efficient Implementation of Third-order Tensor Methods with Adaptive Regularization for Unconstrained Optimization	12
Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints	12
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form	12
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	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
A penalty-free method with nonmonotone line search for nonlinear optimization	9
Computing minimum-volume enclosing ellipsoids	8
Parallel and distributed asynchronous adaptive stochastic gradient methods	7
Multiparent path relinking. An application to the power dominating set problem	7
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem	6
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization	6
Structure-aware methods for expensive derivative-free nonsmooth composite optimization	6
The smoothed duality gap as a stopping criterion	5
Adaptive sieving: a dimension reduction technique for sparse optimization problems	5
Nonlinear conjugate gradient for smooth convex functions	5
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	5
QOCO: a quadratic objective conic optimizer with custom solver generation	5

Progressively strengthening and tuning MIP solvers for reoptimization	5
Graph-Based modeling and decomposition of hierarchical optimization problems	5