verified SJR 0,473 · Q2 • database Scopus / SJR & Web of Science indexed

Netherlands · Elsevier B.V.

workspace_premium Q2 — Applied Mathematics lock_open Open Access

Discrete Optimization

Discrete Optimization is a journal indexed in SJR in Applied Mathematics and Computational Theory and Mathematics with an H index of 44. It has an SJR impact factor of 0,473 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,473.

ISSN: 1572-5286

Publisher: Elsevier B.V.

Category: Applied Mathematics

Indexation: verifiedScopus / SJR verifiedWeb of Science

open_in_new Portal NPD menu_book Guidelines NPD

schedule CountryOfPapers database fields

SJR Impact Factor trending_up

0,473 Q2

H-index 44

Acceptance rate pie_chart

33%

Source Acceptance_Rate

Time to publication hourglass_top

NPD

Field NPD

Publication cost (APC) payments

NPD Open Access

Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,473

H-index

Docs (year)

Docs 3y

Total refs

600

Cites 3y

121

Citable 3y

Cites/Doc 2y

1.62

Ref/Doc

28.57

Immediate OA

—

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.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

An exact approach for the Vertex Coloring Problem

Valid inequalities for the single arc design problem with set-ups

Computing robust basestock levels

Computing integral solutions of complementarity problems

Complexity of the min-max (regret) versions of min cut problems

Combined route capacity and route length models for unit demand vehicle routing problems

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction

Bounds for online bounded space hypercube packing

Biclique completion problems for multicast network design

Approximation of the Quadratic Set Covering problem

Approximability results for the maximum and minimum maximal induced matching problems

Anchored rectangle and square packings

SHOW MORE ARTICLES

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

A branch-and-cut approach to the crossing number problem

Advances on defective parameters in graphs

A unified interpretation of several combinatorial dualities

A strongly polynomial algorithm for line search in submodular polyhedra

A Special Issue in Memory of George B. Dantzig

A primal-dual method for approximating tree cover with two weights

A pricing problem under Monge property

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

A linear time algorithm for balance vertices on trees

A hybrid algorithm for the unbounded knapsack problem

FAQs

Discrete Optimization has an SJR of 0,473 (best quartile Q2) in the CountryOfPapers database.

Immediate OA APC is not available (NPD). Non-OA / submission fee is 0 EUR.

The acceptance rate recorded for Discrete Optimization is 33%.

Discrete Optimization

Metrics

Name good journals. Call out predatory ones.

Researcher reviews

Best articles by citations

FAQs

What is the SJR of Discrete Optimization?

What is the APC / publication cost?

What is the acceptance rate?