1 |
S. U. Lee, "Optimal Solution of a Large- scale Travelling Salesman Problem applying DNN and k-opt," The Journal of The Institute of Internet, Broadcasting and Communication (IIBC), Vol. 15, No. 4, pp.249-257, Aug. 2015, doi:10.7236/JIIBC.2015.15.4.249
DOI
|
2 |
R. W. Irving, P. Leather and D. Gusfield, "An Efficient Algorithm for the Optimal Stable Marriage," Journal of the ACM, Vol. 34, No. 3, pp. 532-543, Jul. 1987, 10.1145/28869.28871
DOI
|
3 |
S. U. Lee, "A Degree-Constrained Minimum Spanning Tree Algorithm Using k-opt," Journal of The Korea Society of Computer and Information, Vol. 20, No. 5, pp. 31-39, May 2015, doi:10.9708/jksci.2015.20.5.031
DOI
|
4 |
D. Gale and L. S. Shapley, L. S. "College Admissions and the Stability of Marriage," American Mathematical Monthly, Vol. 69, No. 1, pp. 9-14, Jan. 1962, doi:10.1080/ 00029890.1962.11989827
DOI
|
5 |
K. Iwama and S. Miyazaki, "A Survey of the Stable Marriage Problem and Its Variants," International Conference on Informatics Education and Research for Knowledge-Circulating Society, pp. 131-136, Jan. 2008, doi:10.1109/ ICKS.2008.7
DOI
|
6 |
S. U. Lee, "The Extended k-opt Algorithm for Traveling Salesman Problem," Journal of The Korea Society of Computer and Information, Vol. 17, No. 10, pp. 155-165, Oct. 2012, doi:10.9708/jksci/2012.17.10.155
DOI
|