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

Table 1

The cost matrix with row minima and column minima.

Node	1	2	3	4	5	6	7	Row minima
1	999	75	99	9	35	63	8	8
2	51	999	86	46	88	29	20	20
3	100	5	999	16	28	35	28	5
4	20	45	11	999	59	53	49	11
5	86	63	33	65	999	76	72	33
6	36	53	89	31	21	999	52	21
7	58	31	43	67	52	60	999	31
Column minima	9	0	0	1	0	9	0