Cost efficient network synthesis from leased lines:
Abstract: "Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capac...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1997
|
| Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1997,22 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. We treat, in addition, several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real world data." |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV017189191 | ||
| 003 | DE-604 | ||
| 005 | 20031002 | ||
| 007 | t| | ||
| 008 | 030604s1997 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)38761554 | ||
| 035 | |a (DE-599)BVBBV017189191 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 100 | 1 | |a Alevras, Dimitris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Cost efficient network synthesis from leased lines |c Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1997 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |v 1997,22 | |
| 520 | 3 | |a Abstract: "Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. We treat, in addition, several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real world data." | |
| 650 | 4 | |a Data transmission systems | |
| 650 | 4 | |a Integer programming | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Telecommunication | |
| 700 | 1 | |a Grötschel, Martin |d 1948- |e Verfasser |0 (DE-588)108975282 |4 aut | |
| 700 | 1 | |a Wessäly, Roland |d 1967- |e Verfasser |0 (DE-588)122164350 |4 aut | |
| 810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1997,22 |w (DE-604)BV004801715 |9 1997,22 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010360172 | |
Datensatz im Suchindex
| _version_ | 1820882518699671552 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Alevras, Dimitris Grötschel, Martin 1948- Wessäly, Roland 1967- |
| author_GND | (DE-588)108975282 (DE-588)122164350 |
| author_facet | Alevras, Dimitris Grötschel, Martin 1948- Wessäly, Roland 1967- |
| author_role | aut aut aut |
| author_sort | Alevras, Dimitris |
| author_variant | d a da m g mg r w rw |
| building | Verbundindex |
| bvnumber | BV017189191 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)38761554 (DE-599)BVBBV017189191 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV017189191</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031002</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030604s1997 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38761554</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017189191</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alevras, Dimitris</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cost efficient network synthesis from leased lines</subfield><subfield code="c">Dimitris Alevras ; Martin Grötschel ; Roland Wessäly</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="v">1997,22</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. We treat, in addition, several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real world data."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data transmission systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grötschel, Martin</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108975282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wessäly, Roland</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122164350</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="t">Preprint SC</subfield><subfield code="v">1997,22</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1997,22</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010360172</subfield></datafield></record></collection> |
| id | DE-604.BV017189191 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T17:08:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010360172 |
| oclc_num | 38761554 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 19 S. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| spelling | Alevras, Dimitris Verfasser aut Cost efficient network synthesis from leased lines Dimitris Alevras ; Martin Grötschel ; Roland Wessäly Berlin Konrad-Zuse-Zentrum für Informationstechnik 1997 19 S. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1997,22 Abstract: "Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. We treat, in addition, several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real world data." Data transmission systems Integer programming Operations research Telecommunication Grötschel, Martin 1948- Verfasser (DE-588)108975282 aut Wessäly, Roland 1967- Verfasser (DE-588)122164350 aut Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1997,22 (DE-604)BV004801715 1997,22 |
| spellingShingle | Alevras, Dimitris Grötschel, Martin 1948- Wessäly, Roland 1967- Cost efficient network synthesis from leased lines Data transmission systems Integer programming Operations research Telecommunication |
| title | Cost efficient network synthesis from leased lines |
| title_auth | Cost efficient network synthesis from leased lines |
| title_exact_search | Cost efficient network synthesis from leased lines |
| title_full | Cost efficient network synthesis from leased lines Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
| title_fullStr | Cost efficient network synthesis from leased lines Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
| title_full_unstemmed | Cost efficient network synthesis from leased lines Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
| title_short | Cost efficient network synthesis from leased lines |
| title_sort | cost efficient network synthesis from leased lines |
| topic | Data transmission systems Integer programming Operations research Telecommunication |
| topic_facet | Data transmission systems Integer programming Operations research Telecommunication |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT alevrasdimitris costefficientnetworksynthesisfromleasedlines AT grotschelmartin costefficientnetworksynthesisfromleasedlines AT wessalyroland costefficientnetworksynthesisfromleasedlines |