OPTIMAL-DESIGN OF A 2-LEVEL HIERARCHICAL NETWORK WITH TREE-STAR CONFIGURATION

This paper deals with the topological design problem of a hierarchical two-level network where the upper-level backbone network is of tree type and the lower-level local access networks are of star-type. As a means to widen the real-world applicability over the existing network design studies, a backbone node not opened is allowed to be included in the backbone tree for transhipment purpose. The problem is modelled as a mixed 0-1 integer programming, whose special structure is exploited for the development of a dual-based lower bounding procedure. The procedure is incorporated in the branch and bound solution method, whose effectiveness is well demonstrated by the computational experiments conducted with a variety of problems ranging up to 50 backbone nodes and 200 demand points.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1992-07
Language
ENG
Keywords

STEINER PROBLEM; ALGORITHMS

Citation

COMPUTERS INDUSTRIAL ENGINEERING, v.22, no.3, pp.273 - 281

ISSN
0360-8352
URI
http://hdl.handle.net/10203/4846
Appears in Collection
KSIM-Journal Papers(저널논문)
  • Hit : 323
  • Download : 7
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 11 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0