Traveling: a world tour without a plane

被引：0

作者：

Duclos, Jean-Francois ^{[1
]}

机构：

[1] Metropolitan State Univ Denver, Denver, CO 80204 USA

来源：

FRENCH REVIEW | 2020年 / 93卷 / 04期

关键词：

D O I：

暂无

中图分类号：

I3/7 [各国文学];

学科分类号：

摘要：

引用

页码：242 / 243

页数：2

共 50 条

[41] Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour
Gutin, G
Yeo, A
[J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) : 321 - 327
[42] ENTERITIS SECONDARY TO GIARDIA LAMBLIA IN STUDENTS TRAVELING ON TOUR IN RUSSIA
JOHNSON, DD
[J]. JOURNAL OF THE AMERICAN COLLEGE OF HEALTH ASSOCIATION, 1972, 20 (03): : 207 - 208
[43] INDUSTRIAL APPLICATION OF THE TRAVELING SALESMANS SUB-TOUR PROBLEM
GENSCH, DH
[J]. AIIE TRANSACTIONS, 1978, 10 (04): : 362 - 370
[44] Estimating the Tour Length for the Close Enough Traveling Salesman Problem
Sinha Roy, Debdatta
Golden, Bruce
Wang, Xingyin
Wasil, Edward
[J]. ALGORITHMS, 2021, 14 (04)
[45] When traveling was an art. The romance of the Grand-Tour
Di Ricco, A
[J]. RASSEGNA DELLA LETTERATURA ITALIANA, 1997, 101 (2-3): : 302 - 302
[46] An effective tour construction and improvement procedure for the traveling salesman problem
Zweig, G
[J]. OPERATIONS RESEARCH, 1995, 43 (06) : 1049 - 1057
[47] The 2013 Austrian-Swiss-German Traveling Fellowship tour
Renkawitz, Tobias
Niemeier, Andreas
von Knoch, Fabian
Biedermann, Rainer
[J]. ORTHOPEDIC REVIEWS, 2014, 6 (02) : 48 - 50
[48] Approximating the Traveling Tournament Problem with Maximum Tour Length 2
Thielen, Clemens
Westphal, Stephan
[J]. ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 303 - 314
[49] Finding the Minimum Ratio Traveling Salesman Tour by Artificial Ants
Ma Liang
[J]. Journal of Systems Engineering and Electronics, 2003, (03) : 24 - 27
[50] COMBINATORIAL ALGORITHM FOR M-TOUR TRAVELING SALESMAN PROBLEMS
MARTINEC, I
[J]. EKONOMICKO-MATEMATICKY OBZOR, 1979, 15 (03): : 320 - 341

← 1 2 3 4 5 →