@InProceedings{WoodhamsPrice90,
  title =        "{A} {T}ransputer-based {W}orkstation {A}ccelerator for {O}ptimisation {A}lgorithms",
  author=        "Woodhams,  F. W. D. and Price,  W. L.",
  editor=        "Turner,  Stephen J.",
  pages =        "148--153",
  booktitle=     "{OUG}-12: {T}ools and {T}echniques for {T}ransputer {A}pplications",
  isbn=          "90 5199 029 4",
  year=          "1990",
  month=         "mar",
  abstract=      "This paper discusses the design of a transputer-based
     accelerator for both combinatorial and global optimisation
     algorithms. Combinatorial optimisation has engineering
     applications in, for example, placement and routing of VLSI
     circuits. This type of problem is known to be in the
     complexity class NP-complete 1. For the solution of these
     problems some form of random search heuristic is often
     required. One such heuristic is the simulated annealing
     algorithm\^{}. This algorithm is usually too slow for the
     interactive user and is normally run on a mainframe
     computer."
}