摘要
提出了一个求解难可满足性问题的简单混合算法 .拟人和禁忌表两个策略被给出 .数值实验表明 ,对于一类公认比较难的可满足性问题 ,该算法胜过目前据认为是最好方法之一的 NOVEL
Ahybrid algorithm for solving the satisfiability problem is proposed. Personification strategy and tabu list strategy are presented. Computational experiments on a class of hard problem instances show that, our proposed algorithm yields better results than Novelty algorithm which is currently among the fastest known.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第8期1528-1531,共4页
Journal of Chinese Computer Systems
关键词
可满足性问题
拟人
禁忌表
satisfiability
personification
tabu list
