| # | Title | Journal | Year | Citations |
|---|
| 1 | Tabu Search—Part I | ORSA Journal on Computing | 1989 | 4,815 |
| 2 | Tabu Search—Part II | ORSA Journal on Computing | 1990 | 3,561 |
| 3 | TSPLIB—A Traveling Salesman Problem Library | ORSA Journal on Computing | 1991 | 1,895 |
| 4 | Genetic Algorithms and Random Keys for Sequencing and Optimization | ORSA Journal on Computing | 1994 | 1,177 |
| 5 | A Computational Study of the Job-Shop Scheduling Problem | ORSA Journal on Computing | 1991 | 685 |
| 6 | The Reactive Tabu Search | ORSA Journal on Computing | 1994 | 654 |
| 7 | CONOPT—A Large-Scale GRG Code | ORSA Journal on Computing | 1994 | 542 |
| 8 | Numerical Inversion of Laplace Transforms of Probability Distributions | ORSA Journal on Computing | 1995 | 538 |
| 9 | Tabu Search Applied to the Quadratic Assignment Problem | ORSA Journal on Computing | 1990 | 377 |
| 10 | Fast Algorithms for Geometric Traveling Salesman Problems | ORSA Journal on Computing | 1992 | 369 |
| 11 | The Vehicle Routing Problem with Time Windows: Minimizing Route Duration | ORSA Journal on Computing | 1992 | 342 |
| 12 | Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art | ORSA Journal on Computing | 1994 | 291 |
| 13 | Preprocessing and Probing Techniques for Mixed Integer Programming Problems | ORSA Journal on Computing | 1994 | 287 |
| 14 | Parallel Taboo Search Techniques for the Job Shop Scheduling Problem | ORSA Journal on Computing | 1994 | 280 |
| 15 | Feedforward Neural Nets as Models for Time Series Forecasting | ORSA Journal on Computing | 1993 | 266 |
| 16 | Locating Minimal Infeasible Constraint Sets in Linear Programs | ORSA Journal on Computing | 1991 | 191 |
| 17 | An Implementation of a Primal-Dual Interior Point Method for Linear Programming | ORSA Journal on Computing | 1989 | 180 |
| 18 | A GRASP for the Vehicle Routing Problem with Time Windows | ORSA Journal on Computing | 1995 | 177 |
| 19 | A Computational Study of Local Search Algorithms for Job Shop Scheduling | ORSA Journal on Computing | 1994 | 152 |
| 20 | Solving Large Sparse Nonlinear Programs Using GRG | ORSA Journal on Computing | 1992 | 150 |
| 21 | Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem | ORSA Journal on Computing | 1994 | 143 |
| 22 | A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem | ORSA Journal on Computing | 1991 | 133 |
| 23 | Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut | ORSA Journal on Computing | 1991 | 117 |
| 24 | Implementing the Simplex Method: The Initial Basis | ORSA Journal on Computing | 1992 | 115 |
| 25 | Feature Article—Parallel Discrete Event Simulation: Will the Field Survive? | ORSA Journal on Computing | 1993 | 108 |
| 26 | Optimal Scheduling of Tasks on Identical Parallel Processors | ORSA Journal on Computing | 1995 | 105 |
| 27 | Column Generation Methods for Probabilistic Logic | ORSA Journal on Computing | 1991 | 103 |
| 28 | TES: A Class of Methods for Generating Autocorrelated Uniform Variates | ORSA Journal on Computing | 1991 | 102 |
| 29 | State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective | ORSA Journal on Computing | 1993 | 98 |
| 30 | Mathematical Programming in Neural Networks | ORSA Journal on Computing | 1993 | 92 |
| 31 | An Introduction to Graph-Based Modeling Systems, Part I: Overview | ORSA Journal on Computing | 1990 | 91 |
| 32 | Tabu Thresholding: Improved Search by Nonmonotonic Trajectories | ORSA Journal on Computing | 1995 | 89 |
| 33 | Commentary—Progress in Linear Programming | ORSA Journal on Computing | 1994 | 86 |
| 34 | Identifying Minimally Infeasible Subsystems of Inequalities | ORSA Journal on Computing | 1990 | 84 |
| 35 | Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases | ORSA Journal on Computing | 1990 | 84 |
| 36 | State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming | ORSA Journal on Computing | 1993 | 84 |
| 37 | An Optimal Algorithm for the Orienteering Tour Problem | ORSA Journal on Computing | 1992 | 83 |
| 38 | Using a Hop-Constrained Model to Generate Alternative Communication Network Design | ORSA Journal on Computing | 1992 | 83 |
| 39 | On Finding Primal- and Dual-Optimal Bases | ORSA Journal on Computing | 1991 | 81 |
| 40 | Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm | ORSA Journal on Computing | 1989 | 80 |
| 41 | Backbone Network Design Tools with Economic Tradeoffs | ORSA Journal on Computing | 1990 | 79 |
| 42 | A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem | ORSA Journal on Computing | 1989 | 77 |
| 43 | Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions | ORSA Journal on Computing | 1993 | 77 |
| 44 | Solving the Steiner Tree Problem on a Graph Using Branch and Cut | ORSA Journal on Computing | 1992 | 69 |
| 45 | Fast Clustering Algorithms | ORSA Journal on Computing | 1994 | 68 |
| 46 | An Introduction to Graph-Based Modeling Systems, Part II: Graph-Grammars and the Implementation | ORSA Journal on Computing | 1991 | 65 |
| 47 | Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods | ORSA Journal on Computing | 1995 | 65 |
| 48 | Some Convergence Results for Probabilistic Tabu Search | ORSA Journal on Computing | 1992 | 64 |
| 49 | Duality-Based Algorithms for Scheduling Unrelated Parallel Machines | ORSA Journal on Computing | 1993 | 64 |
| 50 | Unique Names Violations, a Problem for Model Integration or You Say Tomato, I Say Tomahto | ORSA Journal on Computing | 1991 | 61 |
