Informs Journal on Computing

Papers
(The H4-Index of Informs Journal on Computing is 20. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-05-01 to 2025-05-01.)
ArticleCitations
An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs49
Special Issue of INFORMS Journal on Computing—Scalable Reinforcement Learning Algorithms42
Appreciation to Reviewers, 202341
Code and Data Repository for A New Multicommodity Network Flow Model and Branch and Cut for Optimal Quantum Boolean Circuit Synthesis39
Code and Data Repository for On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis38
Code and Data Repository for Bayesian Network Models for PTSD Screening in Veterans38
Domain-Independent Dynamic Programming and Constraint Programming Approaches for Assembly Line Balancing Problems with Setups34
Code and Data Repository for Aircraft Conflict Resolution: A Benchmark Generator32
Scalable Parallel Nonlinear Optimization with PyNumero and Parapint30
A Bilevel Network Interdiction Problem to Minimize the Number of Active Special Arcs in the Maximum Flow28
Finite Difference Gradient Approximation: To Randomize or Not?27
Robust Models for the Kidney Exchange Problem27
The Descent–Ascent Algorithm for DC Programming25
Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series24
Estimating the Size of Branch-and-Bound Trees24
A Bilevel Optimization Approach for a Class of Combinatorial Problems with Disruptions and Probing23
Code and Data Repository for An Improved Combinatorial Benders Decomposition Algorithm for the Human-Robot Collaborative Assembly Line Balancing Problem22
Code and Data Repository for Symmetric Separable Convex Resource Allocation Problems with Structured Disjoint Interval Bound Constraints22
Code and Data Repository for Computational Framework for Target Tracking Information Fusion Problems21
Note from the Editor21
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix20
Unsupervised Learning for Human Mobility Behaviors20
Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships20
Iterative Deepening Dynamically Improved Bounds Bidirectional Search20
0.0380539894104