CONTINUOUS VARIABLE REPRESENTATION OF TRAVELING SALESMAN PROBLEM

被引:2
作者
SVESTKA, JA
机构
关键词
D O I
10.1007/BF01609019
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:211 / 213
页数:3
相关论文
共 8 条
[1]   TRAVELING SALESMAN PROBLEM - A SURVEY [J].
BELLMORE, M ;
NEHAUSE.GL .
OPERATIONS RESEARCH, 1968, 16 (03) :538-&
[2]   PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].
BELLMORE, M ;
MALONE, JC .
OPERATIONS RESEARCH, 1971, 19 (02) :278-&
[3]  
Garfinkel R. S., 1972, INTEGER PROGRAMMING
[4]  
Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]
[5]  
LITTLE MDC, 1963, OPERATIONS RES, V11, P979
[6]  
RUBIN RS, 1975, OPER RES, V23, P555
[7]   COMPUTATIONAL EXPERIENCE WITH AN M-SALESMAN TRAVELING SALESMAN ALGORITHM [J].
SVESTKA, JA ;
HUCKFELD.VE .
MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 19 (07) :790-799
[8]  
TANAHASHI T, 1971, CARDINALITY CONSTRAI