http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Complex Search Technique for Solving the Quadratic Assignment Problem
Ider Tseveendorj,Catherine Roucairol,Bazarragchaa Barsbold,Enkhbat Rentsen,Bertrand Le Cun,Francois Galea 한국멀티미디어학회 2009 한국멀티미디어학회 국제학술대회 Vol.2009 No.-
An algorithm recently developed by Enkhbat et al. based on continuous relaxation of the quadratic assignment problem generates suboptimal solution of good quality on average giving no sufficient enough verification on global optimality of the generated solution, whereas a branch and bound method provides a solution with verified global optimality, taking on input an upper bound close to global optimality. In this research we investigated possibility for combining these two techniques, so that firstly upper bound is obtained from the relaxed problem using a continuous global optimization, then a branch and bound procedure is taken to solve the problem completely.