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 stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are presented to illustrate the algorithm for solving the NDP.
No takes yet. Share an insight, caveat, or question.
Chen et al. (1991) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: