Travelling salesman problem in groups

被引：0
|
作者：
Akhmedov, A [1 ]
机构：
[1] Yale Univ, Dept Math, New Haven, CT 06520 USA
来源：
Geometric Methods in Group Theory | 2005年 / 372卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We introduce and study the so-called travelling salesman property in finitely generated groups.
引用
收藏
页码：225 / 230
页数：6
相关论文
共 50 条
  • [1] Spatial Transformation of Equality - Generalized Travelling Salesman Problem to Travelling Salesman Problem
    Zia, Mohammed
    Cakir, Ziyadin
    Seker, Dursun Zafer
    [J]. ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2018, 7 (03):
  • [2] The intermittent travelling salesman problem
    Tu-San Pham
    Leyman, Pieter
    De Causmaecker, Patrick
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) : 525 - 548
  • [3] SYMMETRIC TRAVELLING SALESMAN PROBLEM
    RUBINSHTEIN, MI
    [J]. AUTOMATION AND REMOTE CONTROL, 1971, 32 (09) : 1453 - +
  • [4] A Study of Travelling Salesman Problem
    WANG Lin lin
    [J]. The Journal of China Universities of Posts and Telecommunications, 2001, (01) : 15 - 19
  • [5] POPMUSIC for the travelling salesman problem
    Taillard, Eric D.
    Helsgaun, Keld
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (02) : 420 - 429
  • [6] Bees solve 'Travelling Salesman Problem'
    [J]. Engineer, 2010, OCTOBER
  • [7] A heuristic method for the travelling salesman problem
    Mazur, Zygmunt
    Pec, Janusz
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2019, 37 (06) : 7383 - 7388
  • [8] A Labelling Method for the Travelling Salesman Problem
    Tawanda, Trust
    Nyamugure, Philimon
    Kumar, Santosh
    Munapo, Elias
    [J]. APPLIED SCIENCES-BASEL, 2023, 13 (11):
  • [9] A CONTRIBUTION TO THE TRAVELLING-SALESMAN PROBLEM
    MORTON, G
    LAND, AH
    [J]. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 1955, 17 (02) : 185 - 194
  • [10] The Travelling Salesman Problem with Precedence Constraints
    Zakir Hussain Ahmed
    S. N. Narahari Pandit
    [J]. OPSEARCH, 2001, 38 (3) : 299 - 318
12345