Aim & Scope
Mathematical Programming publishes original articles dealing with every aspect of mathematical optimization; that is, everything of direct or indirect use concerning the problem of optimizing a function of many variables, often subject to a set of constraints. This involves theoretical and computational issues as well as application studies. Included, along with the standard topics of linear, nonlinear, integer, conic, stochastic and combinatorial optimization, are techniques for formulating and applying mathematical programming models, convex, nonsmooth and variational analysis, the theory of polyhedra, variational inequalities, and control and game theory viewed from the perspective of mathematical programming. The editorial boards are particularly interested in novel applications of mathematical programming and interfaces with engineering, economics, and computer science. Articles primarily concerned with computational issues such as implementation and testing should in general be submitted to Mathematical Programming Computation. Mathematical Programming consists of two series. Series A publishes original research articles, expositions and surveys, and reports on computational experimentation and new or innovative practical applications as well as short communications dealing with the above. Issues of Series B each focus on a single subject of current interest to the mathematical programming community. Each issue of Series B has one or more guest editors, who need not be members of the editorial board. An issue may be a collection of original articles, a single research monograph or a selection of papers from a conference. [1]
2024
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022
Mathematical Programming , 2024
Distributional utility preference robust optimization models in multi-attribute decision making
J Hu , D Zhang , H Xu , S Zhang
Mathematical Programming , 2024
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
Mathematical Programming , 2024
On the geometry and refined rate of primal–dual hybrid gradient for linear programming
Mathematical Programming , 2024
Efficient separation of RLT cuts for implicit and explicit bilinear terms
K Bestuzheva , A Gleixner , T Achterberg
Mathematical Programming , 2024
Structural iterative rounding for generalized k-median problems
Mathematical Programming , 2024
Monoidal strengthening and unique lifting in MIQCPs
A Chmiela , G Muñoz , F Serrano
Mathematical Programming , 2024
On circuit diameter bounds via circuit imbalances
D Dadush , Z Koh , B Natura , L Végh
Mathematical Programming , 2024
Optimal methods for convex nested stochastic composite optimization
Mathematical Programming , 2024