NEW CLASS OF CUTTING PLANES FOR THE SYMMETRIC TRAVELLING SALESMAN PROBLEM.

被引：0

|

作者：

Fleischmann, Bernhard ^{[1
]}

机构：

[1] Univ Hamburg, Hamburg, West Ger, Univ Hamburg, Hamburg, West Ger

来源：

Mathematical Programming, Series B | 1988年 / 40卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

16

引用

收藏

页码：225 / 246

相关论文

共 50 条

[1] A NEW CLASS OF CUTTING PLANES FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM
FLEISCHMANN, B
[J]. MATHEMATICAL PROGRAMMING, 1988, 40 (03) : 225 - 246
[2] USING CUTTING PLANES TO SOLVE SYMMETRIC TRAVELING SALESMAN PROBLEM
MILIOTIS, P
[J]. MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 177 - 188
[3] Maximum travelling salesman problem. I
Sergeev, S. I.
[J]. AUTOMATION AND REMOTE CONTROL, 2014, 75 (12) : 2170 - 2189
[4] Maximum travelling salesman problem. I
S. I. Sergeev
[J]. Automation and Remote Control, 2014, 75 : 2170 - 2189
[5] SYMMETRIC TRAVELLING SALESMAN PROBLEM
RUBINSHTEIN, MI
[J]. AUTOMATION AND REMOTE CONTROL, 1971, 32 (09) : 1453 - +
[6] Cutting planes and the traveling salesman problem
Applegate, D
Bixby, R
Chvátal, V
Cook, W
[J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 429 - 429
[7] The symmetric travelling salesman problem II. New low bounds
Sergeev, S. I.
[J]. AUTOMATION AND REMOTE CONTROL, 2010, 71 (04) : 681 - 696
[8] The symmetric travelling salesman problem II. New low bounds
S. I. Sergeev
[J]. Automation and Remote Control, 2010, 71 : 681 - 696
[9] APPLICATION OF AN EVOLUTIONARY PROGRAM FOR SOLVING THE TRAVELLING-SALESMAN PROBLEM.
IRODOV, V.F.
MAKSIMENKOV, V.P.
[J]. 1981, V 14 (N 4): : 7 - 10
[10] An improved branching rule for the symmetric travelling salesman problem
Shutler, PME
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (02) : 169 - 175

← 1 2 3 4 5 →