A polyhedral approach to multicommodity survivable network design:
Abstract: "The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic dem...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1993
|
Schriftenreihe: | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC
1993,20 |
Schlagworte: | |
Zusammenfassung: | Abstract: "The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and non-redundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. Computational work using this model and the additional inequalities is in progress." |
Beschreibung: | 26 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008896317 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940222s1993 |||| 00||| engod | ||
035 | |a (OCoLC)32499005 | ||
035 | |a (DE-599)BVBBV008896317 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-12 | ||
100 | 1 | |a Stoer, Mechthild |e Verfasser |4 aut | |
245 | 1 | 0 | |a A polyhedral approach to multicommodity survivable network design |c Mechthild Stoer ; Geir Dahl |
264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1993 | |
300 | |a 26 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1993,20 | |
520 | 3 | |a Abstract: "The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and non-redundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. Computational work using this model and the additional inequalities is in progress." | |
650 | 4 | |a Computer network architectures | |
700 | 1 | |a Dahl, Geir |e Verfasser |4 aut | |
830 | 0 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1993,20 |w (DE-604)BV004801715 |9 1993,20 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005886743 |
Datensatz im Suchindex
_version_ | 1804123255137632256 |
---|---|
any_adam_object | |
author | Stoer, Mechthild Dahl, Geir |
author_facet | Stoer, Mechthild Dahl, Geir |
author_role | aut aut |
author_sort | Stoer, Mechthild |
author_variant | m s ms g d gd |
building | Verbundindex |
bvnumber | BV008896317 |
ctrlnum | (OCoLC)32499005 (DE-599)BVBBV008896317 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01686nam a2200301 cb4500</leader><controlfield tag="001">BV008896317</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940222s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32499005</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008896317</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stoer, Mechthild</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A polyhedral approach to multicommodity survivable network design</subfield><subfield code="c">Mechthild Stoer ; Geir Dahl</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">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 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">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1993,20</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and non-redundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. Computational work using this model and the additional inequalities is in progress."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network architectures</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dahl, Geir</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1993,20</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1993,20</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005886743</subfield></datafield></record></collection> |
id | DE-604.BV008896317 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:26:52Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005886743 |
oclc_num | 32499005 |
open_access_boolean | |
owner | DE-12 |
owner_facet | DE-12 |
physical | 26 S. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
publisher | Konrad-Zuse-Zentrum für Informationstechnik |
record_format | marc |
series | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
series2 | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
spelling | Stoer, Mechthild Verfasser aut A polyhedral approach to multicommodity survivable network design Mechthild Stoer ; Geir Dahl Berlin Konrad-Zuse-Zentrum für Informationstechnik 1993 26 S. txt rdacontent n rdamedia nc rdacarrier Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1993,20 Abstract: "The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and non-redundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. Computational work using this model and the additional inequalities is in progress." Computer network architectures Dahl, Geir Verfasser aut Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1993,20 (DE-604)BV004801715 1993,20 |
spellingShingle | Stoer, Mechthild Dahl, Geir A polyhedral approach to multicommodity survivable network design Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC Computer network architectures |
title | A polyhedral approach to multicommodity survivable network design |
title_auth | A polyhedral approach to multicommodity survivable network design |
title_exact_search | A polyhedral approach to multicommodity survivable network design |
title_full | A polyhedral approach to multicommodity survivable network design Mechthild Stoer ; Geir Dahl |
title_fullStr | A polyhedral approach to multicommodity survivable network design Mechthild Stoer ; Geir Dahl |
title_full_unstemmed | A polyhedral approach to multicommodity survivable network design Mechthild Stoer ; Geir Dahl |
title_short | A polyhedral approach to multicommodity survivable network design |
title_sort | a polyhedral approach to multicommodity survivable network design |
topic | Computer network architectures |
topic_facet | Computer network architectures |
volume_link | (DE-604)BV004801715 |
work_keys_str_mv | AT stoermechthild apolyhedralapproachtomulticommoditysurvivablenetworkdesign AT dahlgeir apolyhedralapproachtomulticommoditysurvivablenetworkdesign |