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 2021-02-01 to 2025-02-01.)

Article	Citations
Design and implementation of a modular interior-point solver for linear optimization	166
Parallel and distributed asynchronous adaptive stochastic gradient methods	83
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization	32
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price	13
Solving clustered low-rank semidefinite programs arising from polynomial optimization	12
MiniCP: a lightweight solver for constraint programming	11
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect	9
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem	9
Efficient MIP techniques for computing the relaxation complexity	9
A memetic procedure for global multi-objective optimization	9
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem	8
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds	8
Feasibility Jump: an LP-free Lagrangian MIP heuristic	6
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs	6
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem	5
A fix-propagate-repair heuristic for mixed integer programming	5
A branch and bound algorithm for robust binary optimization with budget uncertainty	4
Efficient algorithms for implementing incremental proximal-point methods	4
Adaptive large neighborhood search for mixed integer programming	4
Local elimination in the traveling salesman problem	3
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems	3
On technical debt in mathematical programming: An exploratory study	3
Faster exact solution of sparse MaxCut and QUBO problems	3
Deterministic global optimization with Gaussian processes embedded	3
Structure-aware methods for expensive derivative-free nonsmooth composite optimization	3

Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations	2
$$\mathtt {Tenscalc}$$: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria	2
Correction to: Asynchronous Lagrangian scenario decomposition	2
Effective matrix adaptation strategy for noisy derivative-free optimization	2
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty	2
Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization	2
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization	2
Self-adaptive ADMM for semi-strongly convex problems	2
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	2
The MIP Workshop 2023 Computational Competition on reoptimization	2
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	2
Progressively strengthening and tuning MIP solvers for reoptimization	2
LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization	2
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form	1
A data driven Dantzig–Wolfe decomposition framework	1
JuMP 1.0: recent improvements to a modeling language for mathematical optimization	1
Nonlinear conjugate gradient for smooth convex functions	1
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs	1
Solving higher dimensional expensive black box global optimization problems using sparse directional search on surrogates	1
Allocation of fungible resources via a fast, scalable price discovery method	1
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	1