| Article ID: | iaor19972253 |
| Country: | United Kingdom |
| Volume: | 4 |
| Issue: | 3 |
| Start Page Number: | 185 |
| End Page Number: | 194 |
| Publication Date: | Oct 1996 |
| Journal: | Location Science |
| Authors: | Park June S., Lee Youngho, Lim Byung Ha |
| Keywords: | networks |
This paper develops a graph-based model and a Lagrangian relaxation scheme to find a provably good solution for the problem of designing Digital Data Service Networks described earlier by Lee et al. The new model and solution procedure reported in this paper can solve large-scale problems that are intractable to the branch-and-cut algorithm developed in the previous papers.