ISSN: 1091-9856
Journal Home
Journal Guideline
INFORMS Journal on Computing Q1 Unclaimed
INFORMS Journal on Computing is a journal indexed in SJR in Software and Information Systems with an H index of 90. It has an SJR impact factor of 1,264 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,264.
Type: Journal
Type of Copyright:
Languages: English
Open Access Policy:
Type of publications:
Publication frecuency: -


- €
Inmediate OANPD
Embargoed OA- €
Non OAMetrics
1,264
SJR Impact factor90
H Index75
Total Docs (Last Year)368
Total Docs (3 years)3297
Total Refs943
Total Cites (3 years)356
Citable Docs (3 years)2.28
Cites/Doc (2 years)43.96
Ref/DocOther journals with similar parameters
International Journal of Computer Vision Q1
IEEE Transactions on Pattern Analysis and Machine Intelligence Q1
Information Fusion Q1
IEEE Transactions on Cybernetics Q1
IEEE Transactions on Evolutionary Computation Q1
Compare this journals
Aims and Scope
Best articles by citations
The Fine Structure of Galls in Phylogenetic Networks
View moreQuantifying Input Uncertainty via Simulation Confidence Intervals
View moreA Genetic Algorithm-Based Approach for Building Accurate Decision Trees
View moreA New Pricing Scheme for Airline Crew Scheduling
View moreAppreciation to Referees
View moreGlobal Optimization of Morse Clusters by Potential Energy Transformations
View moreAn Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
View more"Addendum to ""Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method"
View moreEnhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting
View moreA Linear Programming Approach to Discriminant Analysis with a Reserved-Judgment Region
View moreA Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
View moreScheduling Banner Advertisements on the Web
View moreScheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
View moreA Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
View moreSolving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
View moreThe Ramping Polytope and Cut Generation for the Unit Commitment Problem
View moreThe Online TSP Against Fair Adversaries
View moreOptimal Testing of Digital Microfluidic Biochips
View moreDynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
View moreOn the Design Problem of Multitechnology Networks
View moreFrom the Editor
View moreSearching for Multiple Words in a Markov Sequence
View moreAssembly-Line Scheduling with Concurrent Operations and Parallel Machines
View moreCombining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
View more
Comments