Branching rules for satisfiability

The complexity of theorem-proving procedures

1971 • 6,155 citations

A Computing Procedure for Quantification Theory

1960 • 2,592 citations

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

1986 • 1,777 citations

Automated Theorem Proving: A Logical Basis

1978 • 690 citations

Ten lectures on the probabilistic method

1987 • 391 citations

Design and Analysis of Experiments.

1986 • 383 citations

Infinite and Finite Sets

2003 • 379 citations

Solving propositional satisfiability problems

1990 • 255 citations

Needed: An Empirical Science of Algorithms

1994 • 200 citations

A continuous approach to inductive inference

1992 • 104 citations

Algorithms for testing the satisfiability of propositional formulae

1989 • 96 citations

Branch-and-cut solution of inference problems in propositional logic

1990 • 64 citations

Efficiency and stability of hypergraph SAT algorithms

1996 • 50 citations

Controlled Experimental Design for Statistical Comparison of Integer Programming Algorithms

1979 • 36 citations

Compact normal forms in propositional logic and integer programming formulations

1990 • 26 citations

A Computational Study of Satisfiability Algorithms for Propositional Logic

1994 • 26 citations

Random Generation of Satisfiable and Unsatisfiable CNF Predicates

1992 • 9 citations