The authors obtain a tighter lower bound on the street congestion of optimal realizations. Then a heuristic algorithm based on necessary and sufficient conditions of optimality is proposed. Although it cannot be guaranteed that this algorithm always generates optimal realizations, it indeed generates optimal realizations for all the 60 test instances with which they experimented. This algorithm is also shown to be time efficient.
|Original language||English (US)|
|Number of pages||6|
|Journal||IEEE Transactions on Computers|
|State||Published - Jan 1 1992|