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 2021-10-01 to 2025-10-01.)
ArticleCitations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond266
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds192
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem23
Learning to use local cuts22
On technical debt in mathematical programming: An exploratory study16
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems15
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form14
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems14
Regularized step directions in nonlinear conjugate gradient methods13
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming11
LMBOPT: a limited memory method for bound-constrained optimization11
Computing minimum-volume enclosing ellipsoids10
Parallel and distributed asynchronous adaptive stochastic gradient methods10
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization9
Multiparent path relinking. An application to the power dominating set problem9
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs8
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem7
Progressively strengthening and tuning MIP solvers for reoptimization7
Structure-aware methods for expensive derivative-free nonsmooth composite optimization6
Adaptive sieving: a dimension reduction technique for sparse optimization problems6
The smoothed duality gap as a stopping criterion6
Correction to: Asynchronous Lagrangian scenario decomposition6
0.033186912536621