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 2020-11-01 to 2024-11-01.)

Article	Citations
acados—a modular open-source framework for fast embedded optimal control	142
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library	83
JuMP 1.0: recent improvements to a modeling language for mathematical optimization	66
Deterministic global optimization with Gaussian processes embedded	32
Adaptive large neighborhood search for mixed integer programming	12
Political districting to minimize cut edges	11
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs	10
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	9
Scalable branching on dual decomposition of stochastic mixed-integer programming problems	9
Design and implementation of a modular interior-point solver for linear optimization	9
Efficient unconstrained black box optimization	9
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs	8
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees	8
Faster exact solution of sparse MaxCut and QUBO problems	8
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty	6
LMBOPT: a limited memory method for bound-constrained optimization	6
Incorporating bounds from decision diagrams into integer programming	6
Performance enhancements for a generic conic interior point algorithm	5
Polytope volume by descent in the face lattice and applications in social choice	5
Minotaur: a mixed-integer nonlinear optimization toolkit	5
Benders decomposition with adaptive oracles for large scale optimization	5
MiniCP: a lightweight solver for constraint programming	5
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs	4
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems	4
A dynamic programming approach for generalized nearly isotonic optimization	3

Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization	3
$$\mathtt {Tenscalc}$$: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria	3
A branch and bound algorithm for robust binary optimization with budget uncertainty	3
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	3
A memetic procedure for global multi-objective optimization	3
Feasibility Jump: an LP-free Lagrangian MIP heuristic	2
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization	2
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming	2
The MIP Workshop 2023 Computational Competition on reoptimization	2
Progressively strengthening and tuning MIP solvers for reoptimization	2
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem	2
Computing minimum-volume enclosing ellipsoids	2
A penalized method of alternating projections for weighted low-rank hankel matrix optimization	2
A data driven Dantzig–Wolfe decomposition framework	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
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization	2
Dantzig–Wolfe reformulations for binary quadratic problems	2
Computational aspects of infeasibility analysis in mixed integer programming	2
Self-adaptive ADMM for semi-strongly convex problems	2