Promote Sponsor
verified SJR 1,605 · Q1 • database Scopus / SJR & Web of Science indexed
Computers and Operations Research
United Kingdom · Elsevier Ltd
workspace_premium Q1 — Modeling and Simulation lock Subscription Unclaimed

Computers and Operations Research

Computers and Operations Research is a journal indexed in SJR in Modeling and Simulation and Management Science and Operations Research with an H index of 194. It has an SJR impact factor of 1,605 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,605.

Computers and Operations Research focuses its scope in these topics and keywords: vehicle, routing, fleet, problems, optimization, optimal, models, fire, production, problem, ...

ISSN: 0305-0548
Editorial: Elsevier Ltd
Category: Modeling and Simulation
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
1,605 Q1
H-index 194
Tasa de Aceptación pie_chart
21% Selectiva
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
NPD Subscription
Ruta Non-OA NPD

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

1,605

H-index

194

Docs (year)

325

Docs 3y

864

Total refs

15928

Cites 3y

5245

Citable 3y

864

Cites/Doc 2y

5.67

Ref/Doc

49.01

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

—

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 note on "a simple heuristic for maximizing service of carousel storage"

View more

When are we going to change the learning curve lecture?

View more

An algorithm for the determination of optimal cutting patterns

View more

An algorithm for the biobjective integer minimum cost flow problem

View more

An advanced macro spreadsheet program for the simplex method

View more

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

View more

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

View more

A spreadsheet optimization system for library staff scheduling

View more

A scenario-based stochastic programming approach for technology and capacity planning

View more

A review: The arrangement increasing partial ordering

View more

A queueing model for optimal control of partial buffer sharing in ATM

View more

A partial backorder control for continuous review (r, Q) inventory system with poisson demand and constant lead time

View more
SHOW MORE ARTICLES

A note on optimal policies for a periodic inventory system with emergency orders

View more

A Bayesian approach to a dynamic inventory model under an unknown demand distribution

View more

A note from the editor

View more

A new method for solving capacitated location problems based on a set partitioning approach

View more

A new heuristic for the period traveling salesman problem

View more

A multiple criteria decision model for information system project selection

View more

A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem

View more

A dynamic-server queuing simulation

View more

A design of self-healing ATM networks based on backup virtual paths

View more

A correlation and heuristic approach for obtaining production sequences requiring a minimum of tool replacements

View more

A constrained minimum spanning tree problem

View more

A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs

View more

FAQS