Mathematical Programming Computation

Papers
(The TQCC of Mathematical Programming Computation is 6. 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 2022-01-01 to 2026-01-01.)
ArticleCitations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond226
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds28
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem18
On technical debt in mathematical programming: An exploratory study17
Learning to use local cuts17
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
Regularized step directions in nonlinear conjugate gradient methods14
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
Computing minimum-volume enclosing ellipsoids11
LMBOPT: a limited memory method for bound-constrained optimization11
Parallel and distributed asynchronous adaptive stochastic gradient methods10
A penalty-free method with nonmonotone line search for nonlinear optimization10
Multiparent path relinking. An application to the power dominating set problem9
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization9
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs8
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem7
Structure-aware methods for expensive derivative-free nonsmooth composite optimization7
Progressively strengthening and tuning MIP solvers for reoptimization7
Adaptive sieving: a dimension reduction technique for sparse optimization problems6
Nonlinear conjugate gradient for smooth convex functions6
On the generation of metric TSP instances with a large integrality gap by branch-and-cut6
The smoothed duality gap as a stopping criterion6
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python6
0.039352178573608