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

Article	Citations
acados—a modular open-source framework for fast embedded optimal control	95
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library	62
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation	43
Deterministic global optimization with Gaussian processes embedded	24
JuMP 1.0: recent improvements to a modeling language for mathematical optimization	18
Signomial and polynomial optimization via relative entropy and partial dualization	13
Mixed-integer programming techniques for the connected max-k-cut problem	11
Political districting to minimize cut edges	9
Design and implementation of a modular interior-point solver for linear optimization	9
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs	7
Efficient unconstrained black box optimization	7
Adaptive large neighborhood search for mixed integer programming	7
Incorporating bounds from decision diagrams into integer programming	6
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl	6
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization	6
Scalable branching on dual decomposition of stochastic mixed-integer programming problems	5
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs	5
Polytope volume by descent in the face lattice and applications in social choice	5
LMBOPT: a limited memory method for bound-constrained optimization	4
Minotaur: a mixed-integer nonlinear optimization toolkit	4
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees	4
Faster exact solution of sparse MaxCut and QUBO problems	4
Benders decomposition with adaptive oracles for large scale optimization	4
Performance enhancements for a generic conic interior point algorithm	4
MiniCP: a lightweight solver for constraint programming	4

An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems	3
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs	3
A memetic procedure for global multi-objective optimization	3
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes	3
$$\mathtt {Tenscalc}$$: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria	3
On the generation of metric TSP instances with a large integrality gap by branch-and-cut	3
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization	2
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization	2
Dantzig–Wolfe reformulations for binary quadratic problems	2
Computational aspects of infeasibility analysis in mixed integer programming	2