In
mathematics, the Kalmanson combinatorial conditions are a set of conditions on the
distance matrix used in determining the solvability of the
traveling salesman problem. These conditions apply to a special kind of
cost matrix, the Kalmanson matrix, and are named after Kenneth Kalmanson.
References
Kalmanson, Kenneth (1975), "Edgeconvex circuits and the traveling salesman problem", Canadian Journal of Mathematics, 27 (5): 1000–1010,
doi:10.4153/CJM-1975-104-6,
MR0396329.
In
mathematics, the Kalmanson combinatorial conditions are a set of conditions on the
distance matrix used in determining the solvability of the
traveling salesman problem. These conditions apply to a special kind of
cost matrix, the Kalmanson matrix, and are named after Kenneth Kalmanson.
References
Kalmanson, Kenneth (1975), "Edgeconvex circuits and the traveling salesman problem", Canadian Journal of Mathematics, 27 (5): 1000–1010,
doi:10.4153/CJM-1975-104-6,
MR0396329.