%0 Journal Article
%T A Mean Field Annealing-Based Algorithm for k-Colorable Problem<br>k-着色问题及其均场退火求解算法
%A HU Wei-ming
%A XU Jun-hua
%A HE Zhi-jun
%A <br>胡卫明
%A 徐俊华
%A 何志均
%J 软件学报
%D 2000
%I 
%X The mean field annealing approach is a new neural network model,which improves the simulated annealing approach greatly.In the paper,the via minimization problem in multi-layer routing with adjacent constraints is translated to a k-colorable problem which has more general meanings,and a mean field annealing algorithm for the k-colorable problem is proposed.On the basis of the segment-crossing graph model,the adjacent matrix and the crossing matrix are introduced.A permute matrix of binary variables is used to map the problem to the neural network,and then the energy function is presented.The object item,crossing constrained item and adjacency constrained item in the energy function,and the normalization of neurons prove that the effective result can be gotten.The experimental results show that it is an effective method.
%K Via minimization in multi-layer routing
%K k-colorable problem
%K mean field annealing approach<br>多层通孔最小化
%K k-着色问题
%K 均场退火方法.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=B6DFFD64FE233E63&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=0B39A22176CE99FB&sid=80BD0A2EF8664214&eid=0F7768518993EDDE&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=9