This is a preview. Log in through your library . Abstract In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback