This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem, a problem that has inspired studies by mathematicians, chemists, and physicists.Expand

Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulk- erson, and S.M. Johnson demonstrated in 1954 that large instances of the… Expand

This paper describes a fast and scalable strategy for constructing a radiation hybrid (RH) map from data on different RH panels. The maps on each panel are then integrated to produce a single RH map… Expand

A number of well known results in combinatorial optimization, such as Hoffman's circulation theorem and the matching theorems of Hall and Tutte, can be interpreted as stating that either a certain linear system has a solution or there exists a simple combinatorical reason why it is infeasible.Expand

The early computer implementation of the cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as Gomory cuts; furthermore, they argued for drawing the templates exclusively from the set of linear inequalities that induce facets of the TSP polytope.Expand

Sampling is a fundamental method for approximating answers that cannot be directly computed. Samples often need to be taken from a non-uniform distribution. In this thesis, I present an algorithm to… Expand

To assess incidence of elevated body temperature expressed by stocker cattle marketed in central Kentucky at different times of the year, rectal body temperature data were collected during a 9-mo… Expand

Copyright law, like contract law, is deceptively complex. Just as the familiar elements of offer, acceptance, and consideration can give rise to endless disputes not easily resolved, the seemingly… Expand