Most cited papers in Constraint Satisfaction and Optimization
What are the most cited papers in Constraint Satisfaction and Optimization?
The most cited paper in Constraint Satisfaction and Optimization is "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" (Peter Hart, Nils J. Nilsson, Bertram Raphael, 1968), with 12,723 citations. Next come "Tabu Search—Part II" (5,669) and "Tabu Search—Part I" (5,076).
Showing 50 of 99 papers. Every paper with more than 679 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | A Formal Basis for the Heuristic Determination of Minimum Cost Paths Peter Hart, Nils J. Nilsson, Bertram Raphael · IEEE Transactions on Systems Science and Cybernetics | 1968 | 12,723 |
| 2 | Tabu Search—Part II Fred Glover · INFORMS journal on computing | Feb 1990 | 5,669 |
| 3 | Tabu Search—Part I Fred Glover · INFORMS journal on computing | Aug 1989 | 5,076 |
| 4 | Variable neighborhood search Nenad Mladenović, Pierre Hansen · Computers & Operations Research | Nov 1997 | 4,232 |
| 5 | Why a Diagram is (Sometimes) Worth Ten Thousand Words Jill H. Larkin, Herbert A. Simon · Cognitive Science | 3 Jan 1987 | 3,630 |
| 6 | Metaheuristics in combinatorial optimization Christian Blum, Andrea Roli · ACM Computing Surveys | Sep 2003 | 3,226 |
| 7 | Approximation Algorithms for NP-Hard Problems Dorit S. Hochba · ACM SIGACT News | Jun 1997 | 3,143 |
| 8 | Chaff Matthew W. Moskewicz, Conor F. Madigan, Ying Jie Zhao et al. | 2001 | 2,938 |
| 9 | An Extensible SAT-solver Niklas Eén, Niklas Sörensson · Lecture notes in computer science | 2004 | 2,642 |
| 10 | Consistency in networks of relations Alan K. Mackworth · Artificial Intelligence | Feb 1977 | 2,463 |
| 11 | Sequential Model-Based Optimization for General Algorithm Configuration Frank Hutter, Holger H. Hoos, Kevin Leyton‐Brown · Lecture notes in computer science | 2011 | 2,434 |
| 12 | The Skyline operator S. Borzsony, Donald Kossmann, Konrad Stocker | 13 Nov 2002 | 2,264 |
| 13 | Approximation algorithms for combinatorial problems David S. Johnson · Journal of Computer and System Sciences | Dec 1974 | 2,229 |
| 14 | Generalized quantifiers and natural language Jon Barwise, Robin Cooper · Linguistics and Philosophy | 1981 | 1,930 |
| 15 | Variable neighborhood search: Principles and applications Pierre Hansen, Nenad Mladenović · European Journal of Operational Research | May 2001 | 1,903 |
| 16 | Algorithms in Combinatorial Geometry. Jacob Eli Goodman, Herbert Edelsbrunner · American Mathematical Monthly | May 1989 | 1,811 |
| 17 | Temporal constraint networks Rina Dechter, Itay Meiri, Judea Pearl · Artificial Intelligence | May 1991 | 1,804 |
| 18 | PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains Maria Fox, Derek Long · Journal of Artificial Intelligence Research | Dec 2003 | 1,740 |
| 19 | P-Complete Approximation Problems Sartaj K. Sahni, Teofilo F. Gonzalez · Journal of the ACM | Jul 1976 | 1,725 |
| 20 | A Decision Method for Elementary Algebra and Geometry Alfred Tarski · Texts & monographs in symbolic computation/Texts and monographs in symbolic computation | 1998 | 1,689 |
| 21 | Point-set topological spatial relations Max J. Egenhofer, Robert Franzosa · International Journal of Geographical Information Systems | 1991 | 1,661 |
| 22 | Automating the design of graphical presentations of relational information Jock D. Mackinlay · ACM Transactions on Graphics | Apr 1986 | 1,637 |
| 23 | Vagueness, truth and logic Kit Fine · Synthese | 1975 | 1,600 |
| 24 | Fast planning through planning graph analysis Avrim L. Blum, Merrick L. Furst · Artificial Intelligence | Feb 1997 | 1,566 |
| 25 | Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here Angelo Corana, Michele Marchesi, Claudio Martini et al. · ACM Transactions on Mathematical Software | Sep 1987 | 1,543 |
| 26 | Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research | Dec 1989 | 1,474 |
| 27 | Machine learning for combinatorial optimization: A methodological tour d'horizon Yoshua Bengio, Andrea Lodi, Antoine Prouvost · Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) | 2021 | 1,453 |
| 28 | The structure-mapping engine: Algorithm and examples Brian C. Falkenhainer, Kenneth D. Forbus, Dedre Gentner · Artificial Intelligence | Nov 1989 | 1,451 |
| 29 | Scene Labeling by Relaxation Operations Azriel Rosenfeld, Robert A. Hummel, Steven W. Zucker · IEEE Transactions on Systems Man and Cybernetics | Jun 1976 | 1,401 |
| 30 | Estimating Uncertain Spatial Relationships in Robotics Randall K. Smith, Matthew W. Self, Peter Cheeseman | 1990 | 1,282 |
| 31 | Hyper-heuristics: a survey of the state of the art Edmund K. Burke, Michel Gendreau, Matthew Hyde et al. · Journal of the Operational Research Society | 10 Jul 2013 | 1,277 |
| 32 | Networks of constraints: Fundamental properties and applications to picture processing Ugo Montanari · Information Sciences | 1974 | 1,271 |
| 33 | Cooling Schedules for Optimal Annealing Bruce Hajek · Mathematics of Operations Research | May 1988 | 1,249 |
| 34 | The Algorithm Selection Problem John R. Rice · Advances in computers | 1976 | 1,202 |
| 35 | A new method for solving hard satisfiability problems Bart Selman, Hector J. Levesque, David G. M. Mitchell | 12 Jul 1992 | 1,185 |
| 36 | SCIP: solving constraint integer programs Tobias Achterberg · Mathematical Programming Computation | 19 Jan 2009 | 1,181 |
| 37 | Planning in a hierarchy of abstraction spaces Earl D. Sacerdoti · Artificial Intelligence | 1974 | 1,170 |
| 38 | Parallel Problem Solving from Nature - PPSN VIII GroÃ, Roderich, Dorigo, Marco · Lecture notes in computer science | 2004 | 1,151 |
| 39 | Increasing tree search efficiency for constraint satisfaction problems Robert M. Haralick, Gordon L. Elliott · Artificial Intelligence | Oct 1980 | 1,126 |
| 40 | Analytic and Algorithmic Solution of Random Satisfiability Problems Marc Mézard, Giorgio Parisi, Riccardo Zecchina · Science | 2 Aug 2002 | 1,100 |
| 41 | Tabu Search: A Tutorial Fred Glover · INFORMS Journal on Applied Analytics | Aug 1990 | 1,096 |
| 42 | Generalized best-first search strategies and the optimality of A* Rina Dechter, Judea Pearl · Journal of the ACM | Jul 1985 | 1,081 |
| 43 | A probabilistic heuristic for a computationally difficult set covering problem Thomas A. Feo, Maurício G. C. Resende · Operations Research Letters | Apr 1989 | 1,060 |
| 44 | Visual routines Shimon Ullman · Cognition | Dec 1984 | 1,040 |
| 45 | On the Complexity of k-SAT Russell Impagliazzo, Ramamohan Paturi · Journal of Computer and System Sciences | Mar 2001 | 1,036 |
| 46 | Where the really hard problems are Peter Cheeseman, Bob Kanefsky, William M. Taylor | 24 Aug 1991 | 1,023 |
| 47 | The logic of inexact concepts Joseph A. Goguen · Synthese | Apr 1969 | 1,015 |
| 48 | A model for reasoning about persistence and causation Thomas Dean, Keiji Kanazawa · Computational Intelligence | Feb 1989 | 1,011 |
| 49 | Planning as heuristic search Blai Bonet, Héctor Geffner · Artificial Intelligence | Jun 2001 | 967 |
| 50 | Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D. Ian Hodkinson, Frank Wolter, Michael Zakharyaschev · Lecture notes in computer science | 2001 | 960 |
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.