<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475789644</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123708.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1019156409486</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1019156409486</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Chris Stacey, Tony Eyers, Gary Anido]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We examine the Concave Topology Capacity and Flow Assignment (TCFA) problem. Only two algorithms in the literature are appropriate for solving TCFA problems with concave link cost functions: Kleinrock and Gerla's Concave Branch Elimination (CBE) procedure [20,26] and a greedy link elimination procedure developed by Gersht [21]. However, neither works well in practice. The CBE procedure does not perform well in the context of strongly concave link cost functions. While Gersht's algorithm performs well, its processing requirements are such that it is applicable for small network design problems only. We present a Concave Link Elimination (CLE) procedure, based on Gersht's greedy link elimination procedure. Our algorithm is shown to perform at least as well as Gersht's procedure and to be significantly faster than both the CBE and Gersht procedures. In addition, we formulate a lower bounding problem which we solve using a continuous branch-and-bound procedure to assess the quality of the design procedures.</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">Stacey</subfield>
   <subfield code="D">Chris</subfield>
   <subfield code="u">16 Euroway, Blagrove, SN5 8YQ, Swindon, Wiltshire, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Eyers</subfield>
   <subfield code="D">Tony</subfield>
   <subfield code="u">Institute for Telecommunications Research, University of Wollongong, Northfields Avenue, 2522, Wollongong, NSW, Australia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Anido</subfield>
   <subfield code="D">Gary</subfield>
   <subfield code="u">Institute for Telecommunications Research, University of Wollongong, Northfields Avenue, 2522, Wollongong, NSW, Australia</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">13/2-4(2000-07-01), 351-372</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">13:2-4&lt;351</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">11235</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1019156409486</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:1019156409486</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">Stacey</subfield>
   <subfield code="D">Chris</subfield>
   <subfield code="u">16 Euroway, Blagrove, SN5 8YQ, Swindon, Wiltshire, UK</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">Eyers</subfield>
   <subfield code="D">Tony</subfield>
   <subfield code="u">Institute for Telecommunications Research, University of Wollongong, Northfields Avenue, 2522, Wollongong, NSW, Australia</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">Anido</subfield>
   <subfield code="D">Gary</subfield>
   <subfield code="u">Institute for Telecommunications Research, University of Wollongong, Northfields Avenue, 2522, Wollongong, NSW, Australia</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">13/2-4(2000-07-01), 351-372</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">13:2-4&lt;351</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</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>
