Author:
Tran Trong-Hieu,Pralet Cédric,Fargier Hélène
Publisher
Springer Nature Switzerland
Reference32 articles.
1. Audemard, G., Lagniez, J.M., Mazure, B., Saïs, L.: Integrating conflict driven clause learning to local search. In: 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2009) (2009)
2. Lecture Notes in Computer Science;G Audemard,2013
3. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61–63 (1962)
4. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. Comput. IEEE Trans. 100(8), 677–691 (1986)
5. Crawford, J.: Solving satisfiability problems using a combination of systematic and local search. In: Second Challenge on Satisfiability Testing organized by Center for Discrete Mathematics and Computer Science of Rutgers University (1996)