15 citations · 15 across the 8 of their papers we have counts for
Showing 2005Show all
3 papers · 1 filter
math.CO2005
Derangements in Symmetric Cost Matrices
Howard Kleiman
Let M be an n X n symmetric cost matrix. Assume that D is a derangement in M, i.e.,a set of disjoint cycles consisting of edges that contains all of the n points of M. The modified…
math.CO2005
On Obtaining a Minimally-Valued Derangement in a Symmetric Cost Matrix
Howard Kleiman
Let M be an n X n symmetric cost matrix. Assume that D is a derangement of edges in M, i.e., a set of point-disjoint cycles containing all of the n points of M.The modified Floyd-W…
math.CO2005★ 15 cited
The Symmetric Traveling Salesman Problem
Howard Kleiman
Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as…