Mathematical Programming Computation

(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-01-01 to 2024-01-01.)
OSQP: an operator splitting solver for quadratic programs384
acados—a modular open-source framework for fast embedded optimal control63
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library58
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation41
Deterministic global optimization with Gaussian processes embedded22
Outer approximation with conic certificates for mixed-integer convex problems17
Signomial and polynomial optimization via relative entropy and partial dualization12
Hard to solve instances of the Euclidean Traveling Salesman Problem11
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables11
A novel matching formulation for startup costs in unit commitment11
Mixed-integer programming techniques for the connected max-k-cut problem11
JuMP 1.0: recent improvements to a modeling language for mathematical optimization10
Design and implementation of a modular interior-point solver for linear optimization8
Parsimonious formulations for low-diameter clusters7
Efficient unconstrained black box optimization6
Adaptive large neighborhood search for mixed integer programming6
Political districting to minimize cut edges6
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs6
Incorporating bounds from decision diagrams into integer programming6
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization6
Polytope volume by descent in the face lattice and applications in social choice5
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl5
Performance enhancements for a generic conic interior point algorithm4
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs4
Asynchronous Lagrangian scenario decomposition4
MiniCP: a lightweight solver for constraint programming4
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees4
Minotaur: a mixed-integer nonlinear optimization toolkit4
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes3
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems3
LMBOPT: a limited memory method for bound-constrained optimization3
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs3
Scalable branching on dual decomposition of stochastic mixed-integer programming problems3
$$\mathtt {Tenscalc}$$: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria3
Computational aspects of infeasibility analysis in mixed integer programming2
Faster exact solution of sparse MaxCut and QUBO problems2
Dantzig–Wolfe reformulations for binary quadratic problems2
A memetic procedure for global multi-objective optimization2
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization2
Split cuts from sparse disjunctions2