The purpose of this paper is to present a greedy algorithm. Computational results demonstrate that our greedy algorithm can solve large-scale WRND problems efficiently with errors within 3%–4% on ...