foundations of computational agents
Variable elimination for propositional satisfiability was proposed by Davis and Putnam . VE for optimization has been called non-serial dynamic programming and was invented by Bertelè and Brioschi .
Stochastic local search is described by Spall  and Hoos and Stützle . The any-conflict algorithm is based on Minton et al. . Simulated annealing was invented by Kirkpatrick et al. .