A new asymmetric pyramidally solvable class of the traveling salesman problem

被引：4
|
作者：
Baki, Mohammed Fazle [1 ]
机构：
[1] Univ Windsor, Odette Sch Business, Windsor, ON N9B 3P4, Canada
来源：
OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
traveling salesman problem; pyramidal tour; polynomial time algorithm;
D O I：
10.1016/j.orl.2005.12.001
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present a new method of identifying a class of asymmetric matrices for which an optimal traveling salesman tour exists that is pyramidal. The new class generalizes two previously known classes of matrices and includes some new matrices as well. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：613 / 620
页数：8
相关论文
共 50 条
12345