Using generalized capacitated trees for designing the topology of local access networks
Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Gouveia, Luis [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1997 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 1997 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Telecommunication systems - Kluwer Academic Publishers, 1992, 7(1997), 4 vom: Aug., Seite 315-337 |
|---|---|
| Übergeordnetes Werk: |
volume:7 ; year:1997 ; number:4 ; month:08 ; pages:315-337 |
| Links: |
|---|
| DOI / URN: |
10.1023/A:1019184615054 |
|---|
| Katalog-ID: |
OLC2038591539 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2038591539 | ||
| 003 | DE-627 | ||
| 005 | 20230504055838.0 | ||
| 007 | tu | ||
| 008 | 200819s1997 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1023/A:1019184615054 |2 doi | |
| 035 | |a (DE-627)OLC2038591539 | ||
| 035 | |a (DE-He213)A:1019184615054-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 084 | |a 05.00 |2 bkl | ||
| 100 | 1 | |a Gouveia, Luis |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Using generalized capacitated trees for designing the topology of local access networks |
| 264 | 1 | |c 1997 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Kluwer Academic Publishers 1997 | ||
| 520 | |a Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. | ||
| 650 | 4 | |a Span Tree | |
| 650 | 4 | |a Minimal Span Tree | |
| 650 | 4 | |a Network Design Problem | |
| 650 | 4 | |a Linear Programming Relaxation | |
| 650 | 4 | |a Steiner Tree Problem | |
| 700 | 1 | |a Lopes, Maria João |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Telecommunication systems |d Kluwer Academic Publishers, 1992 |g 7(1997), 4 vom: Aug., Seite 315-337 |w (DE-627)165670193 |w (DE-600)1150324-5 |w (DE-576)034200312 |x 1018-4864 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:1997 |g number:4 |g month:08 |g pages:315-337 |
| 856 | 4 | 1 | |u https://doi.org/10.1023/A:1019184615054 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MKW | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_4306 | ||
| 936 | b | k | |a 05.00 |q VZ |
| 951 | |a AR | ||
| 952 | |d 7 |j 1997 |e 4 |c 08 |h 315-337 | ||
| author_variant |
l g lg m j l mj mjl |
|---|---|
| matchkey_str |
article:10184864:1997----::sngnrlzdaaiaetesodsgightplgo |
| hierarchy_sort_str |
1997 |
| bklnumber |
05.00 |
| publishDate |
1997 |
| allfields |
10.1023/A:1019184615054 doi (DE-627)OLC2038591539 (DE-He213)A:1019184615054-p DE-627 ger DE-627 rakwb eng 620 VZ 05.00 bkl Gouveia, Luis verfasserin aut Using generalized capacitated trees for designing the topology of local access networks 1997 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1997 Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem Lopes, Maria João aut Enthalten in Telecommunication systems Kluwer Academic Publishers, 1992 7(1997), 4 vom: Aug., Seite 315-337 (DE-627)165670193 (DE-600)1150324-5 (DE-576)034200312 1018-4864 nnns volume:7 year:1997 number:4 month:08 pages:315-337 https://doi.org/10.1023/A:1019184615054 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MKW GBV_ILN_32 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4306 05.00 VZ AR 7 1997 4 08 315-337 |
| spelling |
10.1023/A:1019184615054 doi (DE-627)OLC2038591539 (DE-He213)A:1019184615054-p DE-627 ger DE-627 rakwb eng 620 VZ 05.00 bkl Gouveia, Luis verfasserin aut Using generalized capacitated trees for designing the topology of local access networks 1997 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1997 Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem Lopes, Maria João aut Enthalten in Telecommunication systems Kluwer Academic Publishers, 1992 7(1997), 4 vom: Aug., Seite 315-337 (DE-627)165670193 (DE-600)1150324-5 (DE-576)034200312 1018-4864 nnns volume:7 year:1997 number:4 month:08 pages:315-337 https://doi.org/10.1023/A:1019184615054 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MKW GBV_ILN_32 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4306 05.00 VZ AR 7 1997 4 08 315-337 |
| allfields_unstemmed |
10.1023/A:1019184615054 doi (DE-627)OLC2038591539 (DE-He213)A:1019184615054-p DE-627 ger DE-627 rakwb eng 620 VZ 05.00 bkl Gouveia, Luis verfasserin aut Using generalized capacitated trees for designing the topology of local access networks 1997 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1997 Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem Lopes, Maria João aut Enthalten in Telecommunication systems Kluwer Academic Publishers, 1992 7(1997), 4 vom: Aug., Seite 315-337 (DE-627)165670193 (DE-600)1150324-5 (DE-576)034200312 1018-4864 nnns volume:7 year:1997 number:4 month:08 pages:315-337 https://doi.org/10.1023/A:1019184615054 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MKW GBV_ILN_32 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4306 05.00 VZ AR 7 1997 4 08 315-337 |
| allfieldsGer |
10.1023/A:1019184615054 doi (DE-627)OLC2038591539 (DE-He213)A:1019184615054-p DE-627 ger DE-627 rakwb eng 620 VZ 05.00 bkl Gouveia, Luis verfasserin aut Using generalized capacitated trees for designing the topology of local access networks 1997 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1997 Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem Lopes, Maria João aut Enthalten in Telecommunication systems Kluwer Academic Publishers, 1992 7(1997), 4 vom: Aug., Seite 315-337 (DE-627)165670193 (DE-600)1150324-5 (DE-576)034200312 1018-4864 nnns volume:7 year:1997 number:4 month:08 pages:315-337 https://doi.org/10.1023/A:1019184615054 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MKW GBV_ILN_32 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4306 05.00 VZ AR 7 1997 4 08 315-337 |
| allfieldsSound |
10.1023/A:1019184615054 doi (DE-627)OLC2038591539 (DE-He213)A:1019184615054-p DE-627 ger DE-627 rakwb eng 620 VZ 05.00 bkl Gouveia, Luis verfasserin aut Using generalized capacitated trees for designing the topology of local access networks 1997 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1997 Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem Lopes, Maria João aut Enthalten in Telecommunication systems Kluwer Academic Publishers, 1992 7(1997), 4 vom: Aug., Seite 315-337 (DE-627)165670193 (DE-600)1150324-5 (DE-576)034200312 1018-4864 nnns volume:7 year:1997 number:4 month:08 pages:315-337 https://doi.org/10.1023/A:1019184615054 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MKW GBV_ILN_32 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4306 05.00 VZ AR 7 1997 4 08 315-337 |
| language |
English |
| source |
Enthalten in Telecommunication systems 7(1997), 4 vom: Aug., Seite 315-337 volume:7 year:1997 number:4 month:08 pages:315-337 |
| sourceStr |
Enthalten in Telecommunication systems 7(1997), 4 vom: Aug., Seite 315-337 volume:7 year:1997 number:4 month:08 pages:315-337 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Telecommunication systems |
| authorswithroles_txt_mv |
Gouveia, Luis @@aut@@ Lopes, Maria João @@aut@@ |
| publishDateDaySort_date |
1997-08-01T00:00:00Z |
| hierarchy_top_id |
165670193 |
| dewey-sort |
3620 |
| id |
OLC2038591539 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2038591539</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504055838.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1997 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1019184615054</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2038591539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1019184615054-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gouveia, Luis</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using generalized capacitated trees for designing the topology of local access networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1997</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 1997</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Span Tree</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Minimal Span Tree</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network Design Problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear Programming Relaxation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steiner Tree Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lopes, Maria João</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Telecommunication systems</subfield><subfield code="d">Kluwer Academic Publishers, 1992</subfield><subfield code="g">7(1997), 4 vom: Aug., Seite 315-337</subfield><subfield code="w">(DE-627)165670193</subfield><subfield code="w">(DE-600)1150324-5</subfield><subfield code="w">(DE-576)034200312</subfield><subfield code="x">1018-4864</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:1997</subfield><subfield code="g">number:4</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:315-337</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1019184615054</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">05.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">1997</subfield><subfield code="e">4</subfield><subfield code="c">08</subfield><subfield code="h">315-337</subfield></datafield></record></collection>
|
| author |
Gouveia, Luis |
| spellingShingle |
Gouveia, Luis ddc 620 bkl 05.00 misc Span Tree misc Minimal Span Tree misc Network Design Problem misc Linear Programming Relaxation misc Steiner Tree Problem Using generalized capacitated trees for designing the topology of local access networks |
| authorStr |
Gouveia, Luis |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)165670193 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1018-4864 |
| topic_title |
620 VZ 05.00 bkl Using generalized capacitated trees for designing the topology of local access networks Span Tree Minimal Span Tree Network Design Problem Linear Programming Relaxation Steiner Tree Problem |
| topic |
ddc 620 bkl 05.00 misc Span Tree misc Minimal Span Tree misc Network Design Problem misc Linear Programming Relaxation misc Steiner Tree Problem |
| topic_unstemmed |
ddc 620 bkl 05.00 misc Span Tree misc Minimal Span Tree misc Network Design Problem misc Linear Programming Relaxation misc Steiner Tree Problem |
| topic_browse |
ddc 620 bkl 05.00 misc Span Tree misc Minimal Span Tree misc Network Design Problem misc Linear Programming Relaxation misc Steiner Tree Problem |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Telecommunication systems |
| hierarchy_parent_id |
165670193 |
| dewey-tens |
620 - Engineering |
| hierarchy_top_title |
Telecommunication systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)165670193 (DE-600)1150324-5 (DE-576)034200312 |
| title |
Using generalized capacitated trees for designing the topology of local access networks |
| ctrlnum |
(DE-627)OLC2038591539 (DE-He213)A:1019184615054-p |
| title_full |
Using generalized capacitated trees for designing the topology of local access networks |
| author_sort |
Gouveia, Luis |
| journal |
Telecommunication systems |
| journalStr |
Telecommunication systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
1997 |
| contenttype_str_mv |
txt |
| container_start_page |
315 |
| author_browse |
Gouveia, Luis Lopes, Maria João |
| container_volume |
7 |
| class |
620 VZ 05.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Gouveia, Luis |
| doi_str_mv |
10.1023/A:1019184615054 |
| dewey-full |
620 |
| title_sort |
using generalized capacitated trees for designing the topology of local access networks |
| title_auth |
Using generalized capacitated trees for designing the topology of local access networks |
| abstract |
Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. © Kluwer Academic Publishers 1997 |
| abstractGer |
Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. © Kluwer Academic Publishers 1997 |
| abstract_unstemmed |
Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems. © Kluwer Academic Publishers 1997 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MKW GBV_ILN_32 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4306 |
| container_issue |
4 |
| title_short |
Using generalized capacitated trees for designing the topology of local access networks |
| url |
https://doi.org/10.1023/A:1019184615054 |
| remote_bool |
false |
| author2 |
Lopes, Maria João |
| author2Str |
Lopes, Maria João |
| ppnlink |
165670193 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1023/A:1019184615054 |
| up_date |
2024-07-03T19:28:14.988Z |
| _version_ |
1803587310052179968 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2038591539</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504055838.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1997 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1019184615054</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2038591539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1019184615054-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gouveia, Luis</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using generalized capacitated trees for designing the topology of local access networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1997</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 1997</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Span Tree</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Minimal Span Tree</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network Design Problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear Programming Relaxation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steiner Tree Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lopes, Maria João</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Telecommunication systems</subfield><subfield code="d">Kluwer Academic Publishers, 1992</subfield><subfield code="g">7(1997), 4 vom: Aug., Seite 315-337</subfield><subfield code="w">(DE-627)165670193</subfield><subfield code="w">(DE-600)1150324-5</subfield><subfield code="w">(DE-576)034200312</subfield><subfield code="x">1018-4864</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:1997</subfield><subfield code="g">number:4</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:315-337</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1019184615054</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">05.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">1997</subfield><subfield code="e">4</subfield><subfield code="c">08</subfield><subfield code="h">315-337</subfield></datafield></record></collection>
|
| score |
7.4005327 |