SPANNING TREE MANIPULATION AND TRAVELLING SALESMAN PROBLEM

被引：21
作者：
OBRUCA, AK
机构：
来源：
COMPUTER JOURNAL | 1968年 / 10卷 / 04期
关键词：
D O I：
10.1093/comjnl/10.4.374
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：374 / &
相关论文
共 11 条
[1]   A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].
CROES, GA .
OPERATIONS RESEARCH, 1958, 6 (06) :791-812
[2]   ON A LINEAR-PROGRAMMING, COMBINATORIAL APPROACH TO THE TRAVELING-SALESMAN PROBLEM [J].
DANTZIG, GB ;
FULKERSON, DR ;
JOHNSON, SM .
OPERATIONS RESEARCH, 1959, 7 (01) :58-66
[3]  
EASTMAN WL, 1958, SOLUTION TRAVELLING
[4]   A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].
HELD, M ;
KARP, RM .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210
[5]  
Kruskal J. B., 1956, P AM MATH SOC, V7, P48, DOI [DOI 10.1090/S0002-9939-1956-0078686-7, 10.2307/2033241]
[6]   AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].
LITTLE, JDC ;
MURTY, KG ;
SWEENEY, DW ;
KAREL, C .
OPERATIONS RESEARCH, 1963, 11 (06) :972-989
[7]   FORMAL PROCEDURES FOR CONNECTING TERMINALS WITH A MINIMUM TOTAL WIRE LENGTH [J].
LOBERMAN, H ;
WEINBERGER, A .
JOURNAL OF THE ACM, 1957, 4 (04) :428-437
[8]  
OBRUCA A, 1964, COMPUTER B, V8, P67
[9]  
OBRUCA A, 1963, THESIS U NEWCASTLE U
[10]   SOME COMPUTATIONAL NOTES ON THE SHORTEST ROUTE PROBLEM [J].
PERKO, A .
COMPUTER JOURNAL, 1965, 8 (01) :19-20
12