Mathematical Programming Computation

Papers
(The TQCC of Mathematical Programming Computation is 5. 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-12-01 to 2025-12-01.)
ArticleCitations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond216
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds25
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem17
Learning to use local cuts16
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems16
On technical debt in mathematical programming: An exploratory study16
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form14
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming13
Regularized step directions in nonlinear conjugate gradient methods13
Computing minimum-volume enclosing ellipsoids11
A penalty-free method with nonmonotone line search for nonlinear optimization10
LMBOPT: a limited memory method for bound-constrained optimization10
Parallel and distributed asynchronous adaptive stochastic gradient methods9
Multiparent path relinking. An application to the power dominating set problem9
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization8
Progressively strengthening and tuning MIP solvers for reoptimization7
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs7
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem7
Structure-aware methods for expensive derivative-free nonsmooth composite optimization6
On the generation of metric TSP instances with a large integrality gap by branch-and-cut6
The smoothed duality gap as a stopping criterion6
A hierarchy of spectral relaxations for polynomial optimization5
Instance-specific linear relaxations of semidefinite optimization problems5
Nonlinear conjugate gradient for smooth convex functions5
Adaptive sieving: a dimension reduction technique for sparse optimization problems5
5.3045480251312