Abstract

This paper discussed two computationally intensive optimisation algorithms for 0-1 integer programs, namely simulated annealing and branch and bound. It then describes an application specific computing platform designed to accelerate their performance. The paper justifies the general approach and gives details of the algorithms.