A New Journal of the Mathematical Programming Society and Springer Verlag
Initial Volume: 2009
Description
Mathematical Programming Computation (MPC) publishes original research articles covering computational issues in mathematical programming. Articles report on innovative software, comparative tests, modeling environments, libraries of data, and/or applications. A main feature of the journal is the inclusion of accompanying software and data with submitted manuscripts. The journal's review process includes the evaluation and testing of the accompanying software. Where possible, the review will aim for verification of reported computational results.
Topics covered in MPC include linear programming, convex optimization, nonlinear optimization, stochastic optimization, robust optimization, integer programming, combinatorial optimization, global optimization, network algorithms, and modeling languages.
Initial Volume: 2009
Description
Mathematical Programming Computation (MPC) publishes original research articles covering computational issues in mathematical programming. Articles report on innovative software, comparative tests, modeling environments, libraries of data, and/or applications. A main feature of the journal is the inclusion of accompanying software and data with submitted manuscripts. The journal's review process includes the evaluation and testing of the accompanying software. Where possible, the review will aim for verification of reported computational results.
Topics covered in MPC include linear programming, convex optimization, nonlinear optimization, stochastic optimization, robust optimization, integer programming, combinatorial optimization, global optimization, network algorithms, and modeling languages.
Volume 4, Number 1, March 2012
Table of Contents
| Rounding-based heuristics for nonconvex MINLPs | Abstract PDF |
| Giacomo Nannicini, Pietro Belotti | 1-31 |
| Globally solving nonconvex quadratic programming problems via completely positive programming | Abstract PDF |
| Jieqiu Chen, Samuel Burer | 33-52 |
| Fast Fourier optimization | Abstract PDF |
| Robert J. Vanderbei | 53-69 |
| A primal–dual regularized interior-point method for convex quadratic programs | Abstract PDF |
| M. P. Friedlander, D. Orban | 71-107 |

© MPS 2008-2012