A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem

Table 2

The modified cost matrix (*diagonal elements need not have to be computed, which could as well be left as 999).

Node	1	2	3	4	5	6	7
1	982*	67	91	0	27	46	0
2	22	979*	66	25	68	0	0
3	86	0	994*	10	23	21	23
4	0	34	0	987*	48	33	38
5	44	30	0	31	966*	34	39
6	6	32	68	9	0	969*	31
7	18	0	12	35	21	29	968*