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
Original language | English |
---|---|
Title of host publication | Proceedings of the Second Australasian Conference on Parallel and Real Time Systems |
Place of Publication | Fremantle |
Pages | 13-20 |
Number of pages | 8 |
Publication status | Published - Sept 1995 |
Externally published | Yes |