15 citations · 15 across the 8 of their papers we have counts for
11 papers
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…
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…
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…
Bounds for the Solutions of Cubic Diophantine Equations
Howard Kleiman
The original version of this paper did not take into account that there may be solutions (x_0, y_o)in Z X Z of f(x,y) = x^3 + p(y)x + q(y) = 0 even though w_0 = (-3D(y_0))^(1/2) is…
The Floyd-WarshallAlgorithm and the Asymmetric TSP
Howard Kleiman
We improve proofs in "The Floyd-Warshall Algorithm, the AP and the TSP (III). We also simplify the method for obtaining a good upper bound for an optimal solution.
The Floyd-Warshall Algorithm, the AP and the TSP III
Howard Kleiman
We clarify the exposition of Phases 2 and 3a in "The Floyd-Warshall Algorithm, the AP and the TSP". We also improve and simplify theorem 3.6 . In line with clarifying the expositio…