T. H. C. Smith

发表

Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

Gerald L. Thompson, T. H. C. Smith, T. W. S. Meyer, 1990, Discret. Appl. Math..

A parallel algorithm for the 0–1 knapsack problem

T. H. C. Smith, W. Loots, 2005, International Journal of Parallel Programming.

Experimental results on Hillier's linear search

Robert G. Jeroslow, T. H. C. Smith, 1975, Math. Program..

A Parallel Implementation of the Column Subtraction Algorithm

Gerald L. Thompson, T. H. C. Smith, G. Thompson, 1995, Parallel Comput..

A Subtour Elimination Algorithm for the Bottleneck Traveling Salesman Problem.

G. L. Thompson, T. H. C. Smith, 1975 .

A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation

T. H. C. Smith, G. L. Thompson, T. Smith, 1977 .

Wat is rekenaarwetenskap

T. H. C. Smith, 2009 .

A parallel three phase sorting procedure for a k-dimensional hypercube and a transputer implementation

T. H. C. Smith, W. Loots, 1992, Parallel Comput..

Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems.

Gerald L. Thompson, V. Srinivasan, T. H. C. Smith, 1977 .

An improved column subtraction method

Gerald L. Thompson, T. H. C. Smith, J. K. Loots, 2006, South Afr. Comput. J..