A quadratic version of the traveling salesman problem

被引：0

作者：

Fruchard, Augustin ^{[1
,2
]}

Juillet, Nicolas ^{[1
,2
]}

Schafke, Reinhard ^{[3
,4
]}

机构：

[1] Univ Haute Alsace, IRIMAS UR 7499, F-68100 Mulhouse, France

[2] Univ Strasbourg, Strasbourg, France

[3] Univ Strasbourg, Inst Rech Math Avancee, UMR 7501, 7 Rue Rene Descartes, F-67000 Strasbourg, France

[4] CNRS, 7 Rue Rene Descartes, F-67000 Strasbourg, France

来源：

BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE | 2024年 / 67卷 / 02期

关键词：

Traveling salesman problem; combinatorial optimization;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This article presents several results and conjectures in the context of a variant of the traveling salesman problem, in which the cost of travel between two towns is the square of their Euclidean distance.

引用

页码：203 / 222

页数：20