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 2022-05-01 to 2026-05-01.)

Article	Citations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond	285
Learning to use local cuts	32
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem	24
On technical debt in mathematical programming: An exploratory study	23
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds	22
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	15
Efficient Implementation of Third-order Tensor Methods with Adaptive Regularization for Unconstrained Optimization	13
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
Regularized step directions in nonlinear conjugate gradient methods	11
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming	11
Computing minimum-volume enclosing ellipsoids	10
A penalty-free method with nonmonotone line search for nonlinear optimization	10
Parallel and distributed asynchronous adaptive stochastic gradient methods	8
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem	7
Multiparent path relinking. An application to the power dominating set problem	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
The smoothed duality gap as a stopping criterion	6
Adaptive sieving: a dimension reduction technique for sparse optimization problems	5
QOCO: a quadratic objective conic optimizer with custom solver generation	5
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	5
Nonlinear conjugate gradient for smooth convex functions	5
Instance-specific linear relaxations of semidefinite optimization problems	4

Application of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs	4
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python	4
Sparse quadratically constrained quadratic programming via semismooth newton method	4
Graph-Based modeling and decomposition of hierarchical optimization problems	4
RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs	4
A hierarchy of spectral relaxations for polynomial optimization	4
CDOpt: a Python package for a class of Riemannian optimization	3
A fix-propagate-repair heuristic for mixed integer programming	3
A novel linear optimization presolve technique based on Fourier-Motzkin elimination	3
Convex mixed-integer optimization with Frank–Wolfe methods	3
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	2
A computational study of perspective cuts	2
Feasibility Jump: an LP-free Lagrangian MIP heuristic	2
On O(n) algorithms for projection onto the top-k-sum sublevel set	2
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty	2
A new computational framework for log-concave density estimation	2
Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing	1
Optimal design of resolvent splitting algorithms	1
Globally solving concave quadratic programs via doubly nonnegative relaxation	1
K-shortest simple paths using biobjective path search	1
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem	1
Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method	1
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization	1
Efficient MIP techniques for computing the relaxation complexity	1
Faster exact solution of sparse MaxCut and QUBO problems	1
A data driven Dantzig–Wolfe decomposition framework	1
Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems	1
A dynamic programming approach for generalized nearly isotonic optimization	1
Efficient algorithms for implementing incremental proximal-point methods	1
Effective matrix adaptation strategy for noisy derivative-free optimization	1
Self-adaptive ADMM for semi-strongly convex problems	1
JuMP 1.0: recent improvements to a modeling language for mathematical optimization	1
Accurate linear cutting-plane relaxations for ACOPF	1
HPR-LP: An implementation of an HPR method for solving linear programming	1