Topic · Optimization and Search Problems
Most cited papers in Optimization and Search Problems
What are the most cited papers in Optimization and Search Problems?
The most cited paper in Optimization and Search Problems is "Diagnosing Non-Intermittent Anomalies in Reinforcement Learning Policy Executions (Short Paper)" (Esper, Khalil, Spieck, Jan, Sixdenier, Pierre-Louis et al., 2017), with 11,361 citations. Next come "Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey" (5,863) and "Tabu Search—Part II" (5,669).
Showing 50 of 99 papers. Every paper with more than 875 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Diagnosing Non-Intermittent Anomalies in Reinforcement Learning Policy Executions (Short Paper) Esper, Khalil, Spieck, Jan, Sixdenier, Pierre-Louis et al. · arXiv (Cornell University) | 20 Jul 2017 | 11,361 |
| 2 | Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey Ronald Graham, Eugene L. Lawler, Jan Karel Lenstra et al. · Annals of discrete mathematics | 1979 | 5,863 |
| 3 | Tabu Search—Part II Fred Glover · INFORMS journal on computing | Feb 1990 | 5,669 |
| 4 | Tabu Search—Part I Fred Glover · INFORMS journal on computing | Aug 1989 | 5,076 |
| 5 | Impossibility of distributed consensus with one faulty process Michael J. Fischer, Nancy Ann Lynch, Michael Stewart Paterson · Journal of the ACM | Apr 1985 | 4,607 |
| 6 | Algorithm 97: Shortest path Robert W. Floyd · Communications of the ACM | Jun 1962 | 4,080 |
| 7 | Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment C. L. Liu, J. W. Layland · Elsevier eBooks | 2002 | 3,243 |
| 8 | Fab Marko Balabanović, Yoav Shoham · Communications of the ACM | Mar 1997 | 2,940 |
| 9 | The Complexity of Flowshop and Jobshop Scheduling Michael R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research | May 1976 | 2,644 |
| 10 | A Greedy Heuristic for the Set-Covering Problem Vašek Chvátal · Mathematics of Operations Research | Aug 1979 | 2,604 |
| 11 | Universal classes of hash functions J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences | Apr 1979 | 2,577 |
| 12 | Asymptotically efficient adaptive allocation rules Tze-Leung Lai, Herbert E. Robbins · Advances in Applied Mathematics | Mar 1985 | 2,525 |
| 13 | Unreliable failure detectors for reliable distributed systems Tushar Deepak Chandra, Sam Toueg · Journal of the ACM | Mar 1996 | 2,521 |
| 14 | Open, Closed, and Mixed Networks of Queues with Different Classes of Customers Forest Baskett, K. Mani Chandy, Richard R. Muntz et al. · Journal of the ACM | Apr 1975 | 2,457 |
| 15 | Some computer science issues in ubiquitous computing Mark Weiser · Communications of the ACM | Jul 1993 | 2,380 |
| 16 | Online Computation and Competitive Analysis Allan Borodin, Ran El‐Yaniv | 1998 | 2,372 |
| 17 | Similarity estimation techniques from rounding algorithms Moses Charikar | 19 May 2002 | 2,276 |
| 18 | Branch-and-Price: Column Generation for Solving Huge Integer Programs Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser et al. · Operations Research | Jun 1998 | 2,225 |
| 19 | Complexity of Machine Scheduling Problems Jan Karel Lenstra, A. H. G. Rinnooy Kan, Peter Brucker · Annals of discrete mathematics | 1977 | 2,204 |
| 20 | Amortized efficiency of list update and paging rules Daniel D. Sleator, Robert Endre Tarjan · Communications of the ACM | Feb 1985 | 2,129 |
| 21 | The Lagrangian Relaxation Method for Solving Integer Programming Problems Marshall L. Fisher · Management Science | 1981 | 2,118 |
| 22 | A Roadmap of Agent Research and Development Nicholas R. Jennings, Katia P. Sycara, Michael Wooldridge · Autonomous Agents and Multi-Agent Systems | Mar 1998 | 2,114 |
| 23 | Some simplified NP-complete graph problems Michael R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science | Feb 1976 | 2,082 |
| 24 | The Sample Average Approximation Method for Stochastic Discrete Optimization Anton J. Kleywegt, Alexander Shapiro, Tito Homem‐de‐Mello · SIAM Journal on Optimization | 2002 | 2,054 |
| 25 | G2o: A general framework for graph optimization Rainer Kümmerle, Giorgio Grisetti, Hauke Strasdat et al. | May 2011 | 2,029 |
| 26 | A new approach to the maximum-flow problem Andrew V. Goldberg, Robert Endre Tarjan · Journal of the ACM | Oct 1988 | 1,896 |
| 27 | Wait-free synchronization Maurice P. Herlihy · ACM Transactions on Programming Languages and Systems | 1991 | 1,853 |
| 28 | Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services Seth Lewis Gilbert, Nancy Ann Lynch · ACM SIGACT News | Jun 2002 | 1,733 |
| 29 | Coverage problems in wireless ad-hoc sensor networks Saro Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak et al. | 13 Nov 2002 | 1,709 |
| 30 | Epidemic algorithms for replicated database maintenance Alan J. Demers, Dan Greene, Carl H. Hauser et al. | 1987 | 1,680 |
| 31 | Sequential Operations in Digital Picture Processing Azriel Rosenfeld, John L. Pfaltz · Journal of the ACM | Oct 1966 | 1,675 |
| 32 | How bad is selfish routing? Tim Roughgarden, Éva Tardos · Journal of the ACM | Mar 2002 | 1,633 |
| 33 | The Shifting Bottleneck Procedure for Job Shop Scheduling Joseph Adams, Egon Balas, Daniel Joseph Zawack · Management Science | Mar 1988 | 1,611 |
| 34 | Learning Automata: An Introduction Kumpati S. Narendra, Mandayam A. L. Thathachar · CERN Document Server (European Organization for Nuclear Research) | May 1989 | 1,561 |
| 35 | A mobile robotic chemist Benjamin Burger, Phillip M. Maffettone, Vladimir V. Gusev et al. · Nature | 8 Jul 2020 | 1,558 |
| 36 | Genetic Algorithms and Random Keys for Sequencing and Optimization James C. Bean · INFORMS journal on computing | May 1994 | 1,520 |
| 37 | A scheduling model for reduced CPU energy Fei Yao, Alan J. Demers, Scott J. Shenker | 19 Nov 2002 | 1,476 |
| 38 | NP-complete scheduling problems Jeffrey David Ullman · Journal of Computer and System Sciences | Jun 1975 | 1,453 |
| 39 | On optimistic methods for concurrency control H. T. Kung, John T. Robinson · ACM Transactions on Database Systems | Jun 1981 | 1,449 |
| 40 | The power of two choices in randomized load balancing Michael Mitzenmacher · IEEE Transactions on Parallel and Distributed Systems | 2001 | 1,434 |
| 41 | Scheduling subject to resource constraints: classification and complexity Jacek Błażewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan · Discrete Applied Mathematics | 1983 | 1,430 |
| 42 | An Introduction to Multi-Agent Systems Parthasarathy Balaji, Dipti Srinivasan · Studies in computational intelligence | 2010 | 1,382 |
| 43 | A survey of consensus problems in multi-agent coordination Wei Ren, Randal W. Beard, Ella M. Atkins | 10 Aug 2005 | 1,360 |
| 44 | A survey of scheduling problems with setup times or costs Ali Allahverdi, Chi To Ng, T.C.E. Cheng et al. · European Journal of Operational Research | 21 Nov 2006 | 1,356 |
| 45 | The Complexity of Markov Decision Processes Christos H. Papadimitriou, John N. Tsitsiklis · Mathematics of Operations Research | Aug 1987 | 1,355 |
| 46 | A data locality optimizing algorithm Michael E. Wolf, Monica S. Lam | 1991 | 1,341 |
| 47 | A Tutorial on Graph-Based SLAM Giorgio Grisetti, Rainer Kümmerle, Cyrill Stachniss et al. · IEEE Intelligent Transportation Systems Magazine | 2010 | 1,338 |
| 48 | Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem Andrew B. Howard, Maja J. Matarić, Gaurav S. Sukhatme | 2002 | 1,337 |
| 49 | Weighted voting for replicated data David K. Gifford | 1979 | 1,328 |
| 50 | Routing and scheduling in a flexible job shop by tabu search Paolo Brandimarte · Annals of Operations Research | Sep 1993 | 1,317 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.