LARGE TRAVELING SALESMAN PROBLEMS ARISING FROM EXPERIMENTS IN X-RAY CRYSTALLOGRAPHY - A PRELIMINARY-REPORT ON COMPUTATION

被引：58

作者：

BLAND, RG

SHALLCROSS, DF

机构：

来源：

关键词：

D O I：

10.1016/0167-6377(89)90037-0

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：125 / 128

页数：4

共 12 条

[1]

Christofides N., 1975, 388 CARN MELL U GRAD

[2] TIGHT BOUNDS FOR CHRISTOFIDES TRAVELING SALESMAN HEURISTIC [J].

CORNUEJOLS, G ;

NEMHAUSER, GL .

[3]

GOLDEN B, 1985, TRAVELING SALESMAN P

[4] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].

HELD, M ;

KARP, RM .

[5]

Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

[6]

Johnson D.S., 1985, TRAVELING SALESMAN P

[7]

JOHNSON DS, UNPUB NEAR OPTIMAL S

[8]

Lawler E. L., 1985, TRAVELING SALESMAN P

[9] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

[10]

Luger P., 1980, XRAY ANAL SINGLE CRY, DOI [10.1515/9783110836899, DOI 10.1515/9783110836899]