RAND Corporation
Publishes on Advanced Optimization Algorithms Research, Scheduling and Optimization Algorithms, graph theory and CDMA systems. 44 papers and 6.1k citations.
Add your photo, update your bio, and get notified when your ranking changes.
It is shown that a certain tour of 49 cities, one in each of the 48 states and Washington, D.C., has the shortest road distance. Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
A new method for the determination of the equilibrium composition of complex mixtures is described. The general method, which is based on the minimization of free energy, states the problem with unusual simplicity, avoiding many of the usual difficulties of description and computation. Two specific computation procedures are shown, one using a steepest descent technique applied to a quadratic fit, the other making use of linear programing.
By refining Hamming's geometric sphere-packing model a new upper bound for nonsystematic binary error-correcting codes is found. Only combinatorial arguments are used. Whereas Hamming's upper bound estimate for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</tex> -error-correcting codes involved a count of all points <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\leq e</tex> Hamming distance from the set of code points, the model is extended here to include consideration of points which are <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">>e</tex> distance away from the code set. The percentage improvement from Hamming's bounds is sometimes quite sizable for cases of two or more errors to be corrected. The new bound improves on Wax's bounds in all but four of the cases he lists.