| Article ID: | iaor19991408 |
| Country: | Netherlands |
| Volume: | 96 |
| Issue: | 2 |
| Start Page Number: | 323 |
| End Page Number: | 328 |
| Publication Date: | Jan 1997 |
| Journal: | European Journal of Operational Research |
| Authors: | Sancho N.G.F. |
| Keywords: | programming: dynamic |
In this paper we develop a suboptimal solution for the hierarchical network design problem (HNDP) with multiple primary paths. In practice some networks may require solutions to the HNDP with more than one origin/destination pair to be connected by primary paths. This paper develops a dynamic programming solution to find a suboptimal solution to the problem.