Default: OPSEARCH

ISSN: 0030-3887

Journal Home

Journal Guideline

OPSEARCH Q2 Unclaimed

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

OPSEARCH is a journal indexed in SJR in Information Systems and Computer Science Applications with an H index of 33. It has a price of 2290 €. It has an SJR impact factor of 0,409 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,409.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Metrics

OPSEARCH

0,409

SJR Impact factor

33

H Index

216

Total Docs (Last Year)

200

Total Docs (3 years)

9821

Total Refs

513

Total Cites (3 years)

200

Citable Docs (3 years)

2.24

Cites/Doc (2 years)

45.47

Ref/Doc

Comments

No comments ... Be the first to comment!



Best articles by citations

Multi-period optimal defective production problem with variable preparation time

View more

Optimal control of production time of perishable inventory system with finite source of customers

View more

Value-based-matrix-pattern (VBMP) algorithm for fuzzy relation equations with linear objective

View more

Finite Population Loss And Delay Queueing System With Nopassing

View more

An effective heuristic for the P-median problem with application to ambulance location

View more

Stochastic supply chain, transportation models: implementations and benefits

View more

Validating AHP, fuzzy alpha cut and fuzzy preference programming method using clustering technique

View more

Optimal pricing and ordering policies for deteriorating items with multivariate demand under trade credit and inflation

View more

Product form solution for some queueing-inventory supply chain problem

View more

TOPSIS and AHP techniques for selecting the most efficient marine container yard gantry crane

View more

A note on risks in software development with imperfect testing

View more

Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives

View more
SHOW MORE ARTICLES

A discrete time bulk service queue with accessible batch: Geo/ NB (L,K) /1

View more

Parametric approach and genetic algorithm for multi objective linear programming with imprecise parameters

View more

Bottleneck capacitated transportation problem with bounds on rim conditions

View more

On neutrosophic soft rings

View more

Selection of vendor using analytical hierarchy process based on fuzzy preference programming

View more

DEA based estimation of the technical efficiency of state transport undertakings in India

View more

Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search

View more

Remarks on duality for second order minimax fractional programming with B-(p,r)-invex functions

View more

Optimizing fortification plan of capacitated facilities with maximum distance limits

View more

First mover advantage in launch of platform based variants: a leader-follower game with upper bound on prices

View more

A new approach for ranking of candidates in voting systems

View more

Embedded Markov chain approach to retrial queue with vacation, phase repair and multioptional services

View more

FAQS