Mathematical Programming Computation

ISSN: 1867-2949

Journal Home

Journal Guideline

Mathematical Programming Computation Q1 Unclaimed

Springer Verlag Germany
Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Mathematical Programming Computation (MPC) publishes original research articles advancing the state of the art of practical computation in Mathematical Optimization and closely related fields.  Authors are required to submit software source code and data along with their manuscripts (while open-source software is encouraged, it is not required).  Where applicable, the review process will aim for verification of reported computational results.  Topics of articles include: •         New algorithmic techniques, with substantial computational testing •         New applications, with substantial computational testing •         Innovative software •         Comparative tests of algorithms •         Modeling environments •         Libraries of problem instances •         Software frameworks or libraries Among the specific topics covered in MPC are linear programming, convex optimization, nonlinear optimization, stochastic optimization, integer programming, combinatorial optimization, global optimization, network algorithms, and modeling languages. MPC accepts manuscript submission from its own editorial board members in cases in which the identities of the associate editor, reviewers, and technical editor handling the manuscript can remain fully confidential.  To be accepted, manuscripts submitted by editorial board members must meet the same quality standards as all other accepted submissions; there is absolutely no special preference or consideration given to such submissions. Offers original research on computational issues in mathematical programming Article submissions are accompanied by software and data, subject to review and verification processes Coverage includes integer programming, linear programming, convex optimization, nonlinear programming, stochastic and robust optimization and much more It has an SJR impact factor of 2,501.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -


2190 €

Inmediate OA


Embargoed OA

0 €

Non OA


Mathematical Programming Computation


SJR Impact factor


H Index


Total Docs (Last Year)


Total Docs (3 years)


Total Refs


Total Cites (3 years)


Citable Docs (3 years)


Cites/Doc (2 years)




No comments ... Be the first to comment!

Best articles by citations

Blossom V: a new implementation of a minimum cost perfect matching algorithm

View more

Mixed-integer programming techniques for the connected max-k-cut problem

View more

Efficient block-coordinate descent algorithms for the Group Lasso

View more

QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

View more

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

View more

CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization

View more

Feasibility pump 2.0

View more

Parallelizing the dual revised simplex method

View more

Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants

View more

Rounding-based heuristics for nonconvex MINLPs

View more

Certifiably optimal sparse principal component analysis

View more

Intersection cuts for single row corner relaxations

View more

An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix

View more

Solving equilibrium problems using extended mathematical programming

View more

Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation

View more

Learning customized and optimized lists of rules with mathematical programming

View more

Global optimization of nonconvex problems with multilinear intermediates

View more

Computing compatible tours for the symmetric traveling salesman problem

View more

Computing convex hulls and counting integer points with polymake

View more

Using symmetry to optimize over the Sherali-Adams relaxation

View more

A partial proximal point algorithm for nuclear norm regularized matrix least squares problems

View more

Block splitting for distributed optimization

View more

Information-based branching schemes for binary linear mixed integer problems

View more

Solving linear programs with complementarity constraints using branch-and-cut

View more