1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Thomas E. Kent, Arthur G. Richards
The Travelling Salesman and its variations are some of the most well known NP hard optimisation problems. This paper looks to use both centralised and decentralised implementations…