1 |
S. U. Lee, "A Polynomial Time Algorithm of a Traveling Salesman Problem," Journal of KSCI, Vol. 18, No. 12, pp. 75-82, Dec. 2013.
|
2 |
O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
|
3 |
J. Nesetril, E. Milkova, and H. Nesetrilova, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)," DMATH: Discrete Mathematics, Vol. 233, 2001.
|
4 |
D. Bricker, "The Chinese Postman Problem," Department of Industrial Engineering, University of Iowa, 2000. reference: H. A. Eiselt, M. Gendreau, and G. Laporte, "Arc Routing Problems, Part 1: The Chinese Postman Problem," Operations Research, Vol. 43, pp. 231-242, 1995.
DOI
|
5 |
R. C. Larson and A. R. Odoni," Urban Operations Research: Logistical and Transportation Planning Methods," Messachusetts Institute of Technology, Prentice-Hall, 1981.
|
6 |
B. Kallehauge, J. Larsen, and O. B. G. Madsen, "Largrangean Duality Applied on Vehicle Routing with Time Windows: Experimental Results," Technical University of Denmark, 2001.
|
7 |
Wikipedia, "Hamiltonian Path Problem," http://en.wikipedia.org/wiki/Hamiltonian_path_problem, Wikimedia Inc., 2016.
|
8 |
Wikipedia, "Eulerian Path," http://en.wikipedia.org/wiki/Eulerian_path, Wikimedia Inc., 2016.
|
9 |
G. Hasle, "Vehicle Routing and Traveling Salesperson Problems," Department of Optimization, SINTEF Applied Mathematics, Oslo, Norway, 2002.
|
10 |
T. V. Hoai, "Vehicle Routing Problem: General Problem for TSP," Faculty of Computer Science and Engineering, Ho Chi Minh University of Technology, 2008.
|
11 |
D. Ahr, "Contributions to Multiple Postmen Problems," Institute of Computer Science University of Heidelberg, 2004.
|
12 |
A. Osterhues and F. Mariak, "On Variants of the k-Chinese Postman Problem," Universitat Dormund, Operations Research und Wirtshaftsinformatik, Vogelporthweg, Dormund, Germany, 2005.
|
13 |
S. U. Lee, "The Extended k-opt Algorithm for Traveling Salesman Problem," Journal of KSCI, Vol. 17, No. 10, pp. 155-165, Oct. 2012.
|