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

Article	Citations
Clarabel: An interior-point solver for conic programs with quadratic objectives	333
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond	36
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem	29
Learning to use local cuts	25
Accelerated nested proximal gradient algorithm for structured sparse optimization with capped-$$\ell _1$$ penalty	25
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds	18
Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints	15
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
On technical debt in mathematical programming: An exploratory study	15
Efficient Implementation of Third-order Tensor Methods with Adaptive Regularization for Unconstrained Optimization	14
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	9
A penalty-free method with nonmonotone line search for nonlinear optimization	9
Parallel and distributed asynchronous adaptive stochastic gradient methods	8
Multiparent path relinking. An application to the power dominating set problem	8
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization	8
Structure-aware methods for expensive derivative-free nonsmooth composite optimization	7
Progressively strengthening and tuning MIP solvers for reoptimization	7
Stronger cuts for Benders’ decomposition for stochastic Unit Commitment Problems based on interval variables	7
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	6
QOCO: a quadratic objective conic optimizer with custom solver generation	6
The smoothed duality gap as a stopping criterion	6
Graph-Based modeling and decomposition of hierarchical optimization problems	5

Nonlinear conjugate gradient for smooth convex functions	5
RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs	5
Adaptive sieving: a dimension reduction technique for sparse optimization problems	5
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python	4
A fix-propagate-repair heuristic for mixed integer programming	4
Convex mixed-integer optimization with Frank–Wolfe methods	4
PDLP: a practical first-order method for large-scale linear programming	4
Application of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs	4
Feasibility Jump: an LP-free Lagrangian MIP heuristic	4
Instance-specific linear relaxations of semidefinite optimization problems	4
A hierarchy of spectral relaxations for polynomial optimization	4
A novel linear optimization presolve technique based on Fourier-Motzkin elimination	4
A preconditioned interior point method for support vector machines using an ANOVA decomposition and NFFT-based matrix–vector products	3
Sparse quadratically constrained quadratic programming via semismooth newton method	3
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty	3
CDOpt: a Python package for a class of Riemannian optimization	3
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	2
Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems	2
Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method	2
On O(n) algorithms for projection onto the top-k-sum sublevel set	2
A new computational framework for log-concave density estimation	2
A dynamic programming approach for generalized nearly isotonic optimization	2
A computational study of perspective cuts	2
Accurate linear cutting-plane relaxations for ACOPF	2
HPR-LP: An implementation of an HPR method for solving linear programming	2
libDIPS – discretization-based semi-infinite and bilevel programming solvers	1
CP-Lib: Benchmark Instances of the Clique Partitioning Problem	1
A general cut-generating strategy for the caterpillar-packing polytope	1
Effective matrix adaptation strategy for noisy derivative-free optimization	1
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization	1
A data driven Dantzig–Wolfe decomposition framework	1
Faster exact solution of sparse MaxCut and QUBO problems	1
K-shortest simple paths using biobjective path search	1
PDFO: a cross-platform package for Powell’s derivative-free optimization solvers	1
An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization	1
Self-adaptive ADMM for semi-strongly convex problems	1
Efficient algorithms for implementing incremental proximal-point methods	1
Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing	1
Performance enhancements for a generic conic interior point algorithm	1
A numerical study of transformed mixed-integer optimal control problems	1
JuMP 1.0: recent improvements to a modeling language for mathematical optimization	1
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect	1
Globally solving concave quadratic programs via doubly nonnegative relaxation	1
Optimal design of resolvent splitting algorithms	1
Efficient MIP techniques for computing the relaxation complexity	1
Solving the market split problem with lattice enumeration	1