摘要
介绍一种自适应流程,结合静态打破对称技术和动态打破对称技术,分析一个给定的布尔优化问题,并挑选最适于问题特点的打破对称技术。实验结果证明,当将这种技术用于布线时,它比纯粹的静态打破对称或动态打破对称在很多情况下可加快解决问题。
A new technique of dynamic symmetry-breaking was introduced and an adaptive flow was proposed which can analyze a given Boolean optimization problem and pick the symmetry-breaking technique that is the best suited to the problem characteristics. Preliminary experimental results show that this approach accelerates problem-solving in many cases compared with pure static symmetry-breaking and pure dynamic symmetry-breaking.
出处
《中南大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2009年第S1期330-334,共5页
Journal of Central South University:Science and Technology
基金
江苏省自然科学基金资助项目(BK2007026)
江苏省"333高层次人才培养工程"专项基金资助项目(2007124)
关键词
布尔函数
整数线性规划
布线算法
对称
Boolean function
integer linear programming
routing algorithms
symmetry