Journal list Promote Sponsor
verified SJR 0,573 · Q2 • database Scopus / SJR & Web of Science indexed
Optimization and Engineering
Netherlands · Springer Netherlands
workspace_premium Q2 — Software lock Subscription

Optimization and Engineering

Optimization and Engineering is a journal indexed in SJR in Software and Electrical and Electronic Engineering with an H index of 50. It has a price of 2290 €. It has an SJR impact factor of 0,573 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,573.

ISSN: 1389-4420
Publisher: Springer Netherlands
Category: Software
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,573 Q2
H-index 50
Acceptance rate pie_chart
32%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
2.290 € Subscription
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,573

H-index

50

Docs (year)

114

Docs 3y

278

Total refs

4869

Cites 3y

714

Citable 3y

266

Cites/Doc 2y

2.58

Ref/Doc

42.71

Immediate OA

2290 €

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

Performance and cost analysis of a Geom/G/1 (G, SV) system

View more

Simultaneous Solution Strategies for Inclusion of Input Saturation in the Optimal Design of Dynamically Operable Plants

View more

Shape optimization for 2D diffusive scalar transport

View more

Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization

View more

The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets

View more

The hybrid-adjoint method: a semi-analytic gradient evaluation technique applied to composite cure cycle optimization

View more

Top-percentile traffic routing problem by dynamic programming

View more

Use of the Constrained Optimization Algorithms in Some Problems of Fracture Mechanics

View more

Using a derivative-free optimization method for multiple solutions of inverse transport problems

View more

Variational inequalities in stock loan models

View more

Synergetic structure-control design via a hybrid gradient-evolutionary algorithm

View more

Prudent constraint-handling technique for multiobjective propeller optimisation

View more
SHOW MORE ARTICLES

Scheduling UET-UCT tasks: branch-and-bound search in the priority space

View more

Parametric Design and Optimisation of Thin-Walled Structures for Food Packaging

View more

Optimization of time delay systems by hybrid functions

View more

Optimization of Construction of Tire Reinforcement by Genetic Algorithm

View more

Optimal topology design of industrial structures using an evolutionary algorithm

View more

Optimal heat exchanger network synthesis using particle swarm optimization

View more

Optimal effectiveness and efficiency of a fin in steady-state: multiobjective approach

View more

Optimal confidence intervals on the variation for operators and gauge in manufacturing process with repeated measurements

View more

On VLSI interconnect optimization and linear ordering problem

View more

On two triality results

View more

On the quality of discrete representations in multiple objective programming

View more

Numerical methods for the estimation of effective diffusion coefficients of 2D controlled drug delivery systems

View more

FAQs