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

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

Application of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs	5
A hierarchy of spectral relaxations for polynomial optimization	5
CDOpt: a Python package for a class of Riemannian optimization	4
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs	4
Convex mixed-integer optimization with Frank–Wolfe methods	4
A fix-propagate-repair heuristic for mixed integer programming	4
Feasibility Jump: an LP-free Lagrangian MIP heuristic	4
A computational study of perspective cuts	3
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty	3
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	3
Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems	3
On O(n) algorithms for projection onto the top-k-sum sublevel set	3
A dynamic programming approach for generalized nearly isotonic optimization	2
Political districting to minimize cut edges	2
Accurate linear cutting-plane relaxations for ACOPF	2
HPR-LP: An implementation of an HPR method for solving linear programming	2
Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method	2
A new computational framework for log-concave density estimation	2
Efficient MIP techniques for computing the relaxation complexity	2