Mathematical Programming Computation

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 2021-11-01 to 2025-11-01.)
ArticleCitations
Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond201
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds24
Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem23
Learning to use local cuts16
On technical debt in mathematical programming: An exploratory study16
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems15
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
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form13
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming11
Parallel and distributed asynchronous adaptive stochastic gradient methods10
LMBOPT: a limited memory method for bound-constrained optimization10
Computing minimum-volume enclosing ellipsoids10
Multiparent path relinking. An application to the power dominating set problem9
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs9
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization7
Progressively strengthening and tuning MIP solvers for reoptimization7
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem7
Adaptive sieving: a dimension reduction technique for sparse optimization problems6
Correction to: Asynchronous Lagrangian scenario decomposition6
Structure-aware methods for expensive derivative-free nonsmooth composite optimization6
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python5
On the generation of metric TSP instances with a large integrality gap by branch-and-cut5
Nonlinear conjugate gradient for smooth convex functions5
Instance-specific linear relaxations of semidefinite optimization problems5
The smoothed duality gap as a stopping criterion5
A hierarchy of spectral relaxations for polynomial optimization4
Feasibility Jump: an LP-free Lagrangian MIP heuristic4
A fix-propagate-repair heuristic for mixed integer programming4
Convex mixed-integer optimization with Frank–Wolfe methods4
CDOpt: a Python package for a class of Riemannian optimization4
A computational study of perspective cuts3
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty3
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl3
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs3
A new computational framework for log-concave density estimation3
On O(n) algorithms for projection onto the top-k-sum sublevel set3
HPR-LP: An implementation of an HPR method for solving linear programming2
Political districting to minimize cut edges2
Efficient algorithms for implementing incremental proximal-point methods2
A dynamic programming approach for generalized nearly isotonic optimization2
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization2
Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method2
Accurate linear cutting-plane relaxations for ACOPF2
Efficient MIP techniques for computing the relaxation complexity2
0.029978036880493