Author:
Fu Huimin,Wu Guanfeng,Liu Jun,Xu Yang
Funder
National Natural Science Foundation of China
Fundamental Research Funds for the Central Universities
Publisher
Springer Science and Business Media LLC
Reference61 articles.
1. Luo C, Su K, Cai S (2014) More efficient two-mode stochastic local search for random 3-satisfiability[J]. Appl Intell 41(3):665–680
2. Fu H, Xu Y, Wu G, Jia H, Zhang W, Hu R (2018) An improved adaptive genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy. Inter JCom Intell Sys 11(1):402–413
3. Yin L, He F, Hung WNN, Song X, Gu M (2012) Maxterm covering for satisfiability. IEEE Trans Comput 61(3):420–426
4. Mavrovouniotis M, Müller FM, Yang S (2017) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern 47(7):1743–1756
5. Bright C, Ilias K, Vijay G (2019) Applying computer algebra systems with SAT solvers to the Williamson conjecture. J Symb Comput 100(2020):187–209
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献