Journal list Promote Sponsor
verified SJR 1,351 · Q1 • database Scopus / SJR & Web of Science indexed
Mathematical Programming Computation
Germany · Springer Verlag
workspace_premium Q1 — Software lock_open Open Access

Mathematical Programming Computation

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 manuscri...

ISSN: 1867-2949
Publisher: Springer Verlag
Category: Software
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Visit publisher site menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
1,351 Q1
H-index 46
Acceptance rate pie_chart
34%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
2.190 € Open Access
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

1,351

H-index

46

Docs (year)

21

Docs 3y

60

Total refs

951

Cites 3y

350

Citable 3y

60

Cites/Doc 2y

6.36

Ref/Doc

45.29

Immediate OA

2190 €

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

A Newton's method for the continuous quadratic knapsack problem

View more

Using symmetry to optimize over the Sherali-Adams relaxation

View more

An exact cooperative method for the uncapacitated facility location problem

View more

An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables

View more

Alternating direction augmented Lagrangian methods for semidefinite programming

View more

ADMM for the SDP relaxation of the QAP

View more

A rotation-based branch-and-price approach for the nurse scheduling problem

View more

A robust and scalable algorithm for the Steiner problem in graphs

View more

A relax-and-cut framework for Gomory mixed-integer cuts

View more

A recipe for finding good solutions to MINLPs

View more

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

View more

A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell

View more
SHOW MORE ARTICLES

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

View more

A branch-and-price algorithm for capacitated hypergraph vertex separation

View more

A new relaxation framework for quadratic assignment problems based on matrix splitting

View more

A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery

View more

A library of local search heuristics for the vehicle routing problem

View more

A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising

View more

A hybrid LP/NLP paradigm for global optimization relaxations

View more

A hybrid branch-and-bound approach for exact rational mixed-integer programming

View more

A heuristic to generate rank-1 GMI cuts

View more

A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming

View more

A factorization with update procedures for a KKT matrix arising in direct optimal control

View more

A derivative-free Gauss-Newton method

View more

FAQs