<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475789326</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123707.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1019193417664</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1019193417664</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A heuristic method for self‐healing ring design in a single‐homing cluster</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Myong‐Rae Chang, Soo Chang]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we consider a SONET (Synchronous Optical NETwork) USHR (Uni‐directional Self‐Healing Ring) design problem for a single‐homing cluster, i.e., a cluster with a single designated hub. The problem is formulated as a nonlinear integer programming problem and a branch and bound heuristic method based on the Lagrangian relaxation and subgradient optimization technique is proposed to handle the problem. In solving any ring design problem, we should deal with two different aspects of the ring design, namely, the ring routing aspect and the ring loading aspect. Both of these two aspects are well integrated and represented in our model. Such an integrated formulation has not been proposed in the existing literature mainly due to its computationally intractable complexity. In order to cope with such complexity, a preprocessing technique for reducing the complexity and several branch and bound strategies are proposed. The efficiency of the proposed method is tested through computational experiments. For the computational experiments, test problems are generated using the data obtained from the actual topologies in Seoul, Korea. The computational experiments show that the proposed method yields near‐optimum designs within reasonable computation time.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Chang</subfield>
   <subfield code="D">Myong‐Rae</subfield>
   <subfield code="u">Department of Industrial Engineering, Pohang University of Science and Technology, Hyojadong San 31, 790‐784, Pohang, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Chang</subfield>
   <subfield code="D">Soo</subfield>
   <subfield code="u">Department of Industrial Engineering, Pohang University of Science and Technology, Hyojadong San 31, 790‐784, Pohang, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Telecommunication Systems</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">14/1-4(2000-08-01), 175-195</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">14:1-4&lt;175</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">14</subfield>
   <subfield code="o">11235</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1019193417664</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1023/A:1019193417664</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Chang</subfield>
   <subfield code="D">Myong‐Rae</subfield>
   <subfield code="u">Department of Industrial Engineering, Pohang University of Science and Technology, Hyojadong San 31, 790‐784, Pohang, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Chang</subfield>
   <subfield code="D">Soo</subfield>
   <subfield code="u">Department of Industrial Engineering, Pohang University of Science and Technology, Hyojadong San 31, 790‐784, Pohang, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Telecommunication Systems</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">14/1-4(2000-08-01), 175-195</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">14:1-4&lt;175</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">14</subfield>
   <subfield code="o">11235</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
