1. Barvinok, A. (1999). Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor. Random Structures and Algorithms, 14, 29–61.
2. Beck, J. C. (2007). Solution-guided multi-point constructive search for job shop scheduling. Journal of Artificial Intelligence Research, 29, 49–77.
3. Chien, S., Rasmussen, L., & Sinclair, A. (2002). Clifford algebras and approximating the permanent. In Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002) (pp. 222–231). New York: ACM.
4. Fürer, M., & Kasiviswanathan, S. P. (2004). An almost linear time approximation algorithm for the permanent of a random (0-1) matrix. In Proceedings of the twenty-fourth international conference on foundations of software technology and theoretical computer science (FSTTCS 2004) (Vol. 3258, pp. 54–61). New York: Springer.
5. Gomes, C. (2003). Complete randomized backtrack search. In M. Milano (Ed.), Constraint and integer programming: Toward a unified methodology (pp. 233–283). Deventer: Kluwer.