Abstract
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 (DDS) Networks described earlier in Lee et al. (Telecommunications Systems, 2, 261-274, 1994; Working paper, West Advanced Technologies, 1994). 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.
| Original language | English |
|---|---|
| Pages (from-to) | 185-194 |
| Number of pages | 10 |
| Journal | Recherche - Transports - Securite |
| Volume | 62 |
| Publication status | Published - 1999 |
Keywords
- Hub location
- Lagrangian relaxation
- Network topology design
- Steiner tree
ASJC Scopus subject areas
- Automotive Engineering
- Transportation