2.1(top 20%)
impact factor
1.3K(top 20%)
papers
39.0K(top 10%)
citations
95(top 5%)
h-index
2.2(top 20%)
impact factor
1.7K
all documents
42.5K
doc citations
146(top 5%)
g-index

Top Articles

#TitleJournalYearCitations
1Combinatorial Auctions: A SurveyINFORMS Journal on Computing2003695
2Feature Article: Optimization for simulation: Theory vs. PracticeINFORMS Journal on Computing2002673
3Scatter Search and Local NLP Solvers: A Multistart Framework for Global OptimizationINFORMS Journal on Computing2007537
4The Granular Tabu Search and Its Application to the Vehicle-Routing ProblemINFORMS Journal on Computing2003404
5State-of-the-Art Review: A User’s Guide to the Brave New World of Designing Simulation ExperimentsINFORMS Journal on Computing2005370
6A Unified Framework for Numerically Inverting Laplace TransformsINFORMS Journal on Computing2006367
7A Stochastic Radial Basis Function Method for the Global Optimization of Expensive FunctionsINFORMS Journal on Computing2007351
8Algorithms for Hybrid MILP/CP Models for a Class of Optimization ProblemsINFORMS Journal on Computing2001332
9Chained Lin-Kernighan for Large Traveling Salesman ProblemsINFORMS Journal on Computing2003317
10A Column Generation Approach for Graph ColoringINFORMS Journal on Computing1996306
11The Vehicle Routing Problem with Time Windows Part II: Genetic SearchINFORMS Journal on Computing1996299
12An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering ProblemINFORMS Journal on Computing2000298
13Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of ResearchINFORMS Journal on Computing1999291
14The Knowledge-Gradient Policy for Correlated Normal BeliefsINFORMS Journal on Computing2009286
15Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing ProblemsINFORMS Journal on Computing1999275
16GRASP and Path Relinking for 2-Layer Straight Line Crossing MinimizationINFORMS Journal on Computing1999264
17Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment ProblemINFORMS Journal on Computing1999248
18A Computational Study of Search Strategies for Mixed Integer ProgrammingINFORMS Journal on Computing1999246
19A Framework for the Evaluation of Session Reconstruction Heuristics in Web-Usage AnalysisINFORMS Journal on Computing2003239
20Solving the Orienteering Problem through Branch-and-CutINFORMS Journal on Computing1998236
21Approximate Dynamic Programming for Ambulance RedeploymentINFORMS Journal on Computing2010222
22A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time WindowsINFORMS Journal on Computing2003221
23An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing2002220
24Feature Article—Genetic Algorithms for the Operations ResearcherINFORMS Journal on Computing1997217
25An Exact Approach to the Strip-Packing ProblemINFORMS Journal on Computing2003215
26Computing in Operations Research Using JuliaINFORMS Journal on Computing2015215
27Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic AssignmentINFORMS Journal on Computing2000214
28A Linear-Programming Approximation of AC Power FlowsINFORMS Journal on Computing2014210
29Reinforcement Learning: A Tutorial Survey and Recent AdvancesINFORMS Journal on Computing2009209
30Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative MechanismsINFORMS Journal on Computing2007198
31When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?INFORMS Journal on Computing2000196
32Efficient Simulation Budget Allocation for Selecting an Optimal SubsetINFORMS Journal on Computing2008195
33Mathematical Programming for Data Mining: Formulations and ChallengesINFORMS Journal on Computing1999194
34State-of-the-Art-Survey—Stochastic Programming: Computation and ApplicationsINFORMS Journal on Computing1997192
35Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing ProblemsINFORMS Journal on Computing2014192
36Job Shop Scheduling by Local SearchINFORMS Journal on Computing1996183
37The Time-Series Link Prediction Problem with Applications in Communication SurveillanceINFORMS Journal on Computing2009183
38Computing Minimum-Weight Perfect MatchingsINFORMS Journal on Computing1999175
39Feature Selection via Mathematical ProgrammingINFORMS Journal on Computing1998172
40Setting the Research Agenda in Automated Timetabling: The Second International Timetabling CompetitionINFORMS Journal on Computing2010171
41The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation AlgorithmsINFORMS Journal on Computing2011170
42Operating Room Pooling and Parallel Surgery Processing Under UncertaintyINFORMS Journal on Computing2011168
43SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line BalancingINFORMS Journal on Computing1997167
44Guided Local Search for the Three-Dimensional Bin-Packing ProblemINFORMS Journal on Computing2003167
45Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial ProblemsINFORMS Journal on Computing1996164
46Extreme Point-Based Heuristics for Three-Dimensional Bin PackingINFORMS Journal on Computing2008162
47Capacitated Network Design—Polyhedral Structure and ComputationINFORMS Journal on Computing1996160
48The Vehicle Routing Problem with Time Windows Part I: Tabu SearchINFORMS Journal on Computing1996159
49Solving Parallel Machine Scheduling Problems by Column GenerationINFORMS Journal on Computing1999157
50Time-Indexed Formulations for Machine Scheduling Problems: Column GenerationINFORMS Journal on Computing2000155