1. E. H. L. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, Wiley, Chichester, 1989.
2. E. Aarts and J. K. Lenstra, eds., Local Search in Combinatorial Optimization, Wiley, Chichester, 1997.
3. W. P. Adams and T. A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in Quadratic Assignment and Related Problems, P. M. Pardalos and H. Wolkowicz, eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science 16, 1994, 43–75, AMS, Providence, RI.
4. W. P. Adams and H. D. Sherali, A tight linearization and an algorithm for zero-one quadratic programming problems, Management Science 32, 1986, 1274–1290.
5. W. P. Adams and H. D. Sherali, Linearization strategies for a class of zero-one mixed integer programming problems, Operations Research 38, 1990, 217–226.