Design of survivable networks:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1992
|
| Schriftenreihe: | Lecture notes in mathematics
1531 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 204 S. graph. Darst. |
| ISBN: | 3540562710 0387562710 9783540562719 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV005863961 | ||
| 003 | DE-604 | ||
| 005 | 20200218 | ||
| 007 | t | ||
| 008 | 921026s1992 gw d||| m||| 00||| eng d | ||
| 020 | |a 3540562710 |9 3-540-56271-0 | ||
| 020 | |a 0387562710 |9 0-387-56271-0 | ||
| 020 | |a 9783540562719 |9 978-3-540-56271-9 | ||
| 035 | |a (OCoLC)231402804 | ||
| 035 | |a (DE-599)BVBBV005863961 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-19 |a DE-12 |a DE-355 |a DE-91G |a DE-824 |a DE-29T |a DE-92 |a DE-706 |a DE-634 |a DE-83 |a DE-188 |a DE-11 | ||
| 084 | |a SI 850 |0 (DE-625)143199: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a DAT 195f |2 stub | ||
| 084 | |a 90C35 |2 msc | ||
| 084 | |a MAT 059f |2 stub | ||
| 100 | 1 | |a Stoer, Mechthild |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Design of survivable networks |c Mechthild Stoer |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1992 | |
| 300 | |a 204 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in mathematics |v 1531 | |
| 502 | |a Zugl.: Augsburg, Univ., Diss., 1991 | ||
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Robustheit |0 (DE-588)4126481-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kostenoptimierung |0 (DE-588)4135132-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerktopologie |0 (DE-588)4208537-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerktheorie |0 (DE-588)4171531-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polyedrische Kombinatorik |0 (DE-588)4132100-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Redundanz |0 (DE-588)4157937-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Netzwerktopologie |0 (DE-588)4208537-8 |D s |
| 689 | 0 | 1 | |a Redundanz |0 (DE-588)4157937-9 |D s |
| 689 | 0 | 2 | |a Kostenoptimierung |0 (DE-588)4135132-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Netzwerktopologie |0 (DE-588)4208537-8 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Polyedrische Kombinatorik |0 (DE-588)4132100-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Netzwerktopologie |0 (DE-588)4208537-8 |D s |
| 689 | 4 | 1 | |a Robustheit |0 (DE-588)4126481-2 |D s |
| 689 | 4 | 2 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 4 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in mathematics |v 1531 |w (DE-604)BV000676446 |9 1531 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=003672484&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003672484 | ||
Datensatz im Suchindex
| _version_ | 1804120054166454272 |
|---|---|
| adam_text | Contents
1 Motivation 5
2 Network Survivability Models Using Node Types 7
2.1 Survivable Telephone Networks 7
2.2 Graph theoretic Formulation 9
2.3 Integer LP Formulation and Associated Polyhedra 14
2.4 An Outline of the Cutting Plane Procedure 16
2.5 Outlook on the Contents 17
3 Survivable Network Design under Connectivity Constraints —
a Survey 19
3.1 Polynomially Solvable Cases 21
3.2 Results for Restricted Costs 25
3.3 Heuristics for General Costs 27
3.4 Exact Algorithms for General Costs 30
4 Decomposition 33
4.1 Bridges, Articulation Nodes, and Paths 34
4.2 Articulation Sets of Size 2 for 2NCON 34
4.3 Articulation Sets of Size 2 for 1ECON 36
4.4 Cutsets of Size 3 for 2CON 40
4.5 Cutsets of Size Jb for fcCON 44
5 Basic Inequalities 49
5.1 Dimension and Trivial Inequalities 49
5.2 Cut Constraints for Low Connectivity 51
5.3 Cut Constraints for fcECON 55
5.4 Node Cut Constraints for 2NCON 63
5.5 (Node) Cut Constraints for ArNCON 66
6 Lifting Theorems 69
6.1 Expansion of Nodes 70
6.2 Addition of Edges 73
6.3 Addition of Nodes of Type 1 74
2 CONTENTS
7 Partition Inequalities 77
7.1 Motivation 77
7.2 Facet Results for fcECON 79
7.3 Facet Results for ifcNCON 85
7.4 Facet Results for Low Connectivity 88
8 Node Partition Inequalities 91
8.1 Generalization of Node Cut Constraints 91
8.2 Validity 93
8.3 Facet Results 94
9 Lifted r Cover Inequalities 101
9.1 Motivation 101
9.2 r Cover Inequalities 103
9.3 Lifted r Cover Inequalities 109
10 Comb Inequalities 113
10.1 Comb Inequalities for 2NCON 113
10.2 Comb Inequalities for ifcNCON 117
10.3 Comb Inequalities for 2ECON 119
11 How to Find Valid Inequalities 125
11.1 Related Polyhedra 126
11.1.1 Special Cases 126
11.1.2 Relaxation 127
11.1.3 Subfaces 128
11.1.4 Projection and Prodon Inequalities 130
11.2 Small Polyhedra 134
11.3 Generalization of Validity Proofs 142
11.4 Fractional Solutions 146
11.5 Redundant Inequalities • 150
11.5.1 Little Man Inequalities 152
11.6 Open Problems 153
12 Implementation of the Cutting Plane Algorithm 155
12.1 The Framework 155
12.2 Complexity of the Separation Problems • 157
12.3 Separating Partition Inequalities 161
12.3.1 Transforming Cuts into Partitions 162
12.3.2 Shrinking Criteria for Partition Inequalities 165
12.4 Separating Node Partition Inequalities • 166
12.5 Separating Lifted r Cover Inequalities 168
12.5.1 Shrinking One Paths • 170
12.5.2 The Padberg Rao Algorithm • 170
12.5.3 Converting H, T into a Lifted r Cover Constraint • 172
12.6 Other Details • 172
CONTENTS 3
13 Computational Results 175
13.1 Low Connectivity Problems 175
13.2 High Connectivity Problems 183
13.2.1 Random Problems 183
13.2.2 The Ship Problem 187
Conclusion 195
Bibliography 197
Index 205
|
| any_adam_object | 1 |
| author | Stoer, Mechthild |
| author_facet | Stoer, Mechthild |
| author_role | aut |
| author_sort | Stoer, Mechthild |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV005863961 |
| classification_rvk | SI 850 SK 890 |
| classification_tum | DAT 195f MAT 059f |
| ctrlnum | (OCoLC)231402804 (DE-599)BVBBV005863961 |
| discipline | Informatik Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02756nam a2200685 cb4500</leader><controlfield tag="001">BV005863961</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200218 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">921026s1992 gw d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540562710</subfield><subfield code="9">3-540-56271-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387562710</subfield><subfield code="9">0-387-56271-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540562719</subfield><subfield code="9">978-3-540-56271-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231402804</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005863961</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 850</subfield><subfield code="0">(DE-625)143199:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 195f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 059f</subfield><subfield code="2">stub</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">Design of survivable networks</subfield><subfield code="c">Mechthild Stoer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">204 S.</subfield><subfield code="b">graph. Darst.</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">Lecture notes in mathematics</subfield><subfield code="v">1531</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Augsburg, Univ., Diss., 1991</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Robustheit</subfield><subfield code="0">(DE-588)4126481-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kostenoptimierung</subfield><subfield code="0">(DE-588)4135132-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerktopologie</subfield><subfield code="0">(DE-588)4208537-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyedrische Kombinatorik</subfield><subfield code="0">(DE-588)4132100-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Redundanz</subfield><subfield code="0">(DE-588)4157937-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerktopologie</subfield><subfield code="0">(DE-588)4208537-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Redundanz</subfield><subfield code="0">(DE-588)4157937-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kostenoptimierung</subfield><subfield code="0">(DE-588)4135132-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Netzwerktopologie</subfield><subfield code="0">(DE-588)4208537-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Polyedrische Kombinatorik</subfield><subfield code="0">(DE-588)4132100-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Netzwerktopologie</subfield><subfield code="0">(DE-588)4208537-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Robustheit</subfield><subfield code="0">(DE-588)4126481-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="2"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in mathematics</subfield><subfield code="v">1531</subfield><subfield code="w">(DE-604)BV000676446</subfield><subfield code="9">1531</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=003672484&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003672484</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV005863961 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:35:59Z |
| institution | BVB |
| isbn | 3540562710 0387562710 9783540562719 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003672484 |
| oclc_num | 231402804 |
| open_access_boolean | |
| owner | DE-384 DE-19 DE-BY-UBM DE-12 DE-355 DE-BY-UBR DE-91G DE-BY-TUM DE-824 DE-29T DE-92 DE-706 DE-634 DE-83 DE-188 DE-11 |
| owner_facet | DE-384 DE-19 DE-BY-UBM DE-12 DE-355 DE-BY-UBR DE-91G DE-BY-TUM DE-824 DE-29T DE-92 DE-706 DE-634 DE-83 DE-188 DE-11 |
| physical | 204 S. graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in mathematics |
| series2 | Lecture notes in mathematics |
| spelling | Stoer, Mechthild Verfasser aut Design of survivable networks Mechthild Stoer Berlin [u.a.] Springer 1992 204 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in mathematics 1531 Zugl.: Augsburg, Univ., Diss., 1991 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Robustheit (DE-588)4126481-2 gnd rswk-swf Kostenoptimierung (DE-588)4135132-0 gnd rswk-swf Netzwerktopologie (DE-588)4208537-8 gnd rswk-swf Netzwerktheorie (DE-588)4171531-7 gnd rswk-swf Polyedrische Kombinatorik (DE-588)4132100-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Redundanz (DE-588)4157937-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Netzwerktopologie (DE-588)4208537-8 s Redundanz (DE-588)4157937-9 s Kostenoptimierung (DE-588)4135132-0 s DE-604 Algorithmus (DE-588)4001183-5 s Polyedrische Kombinatorik (DE-588)4132100-5 s Netzwerktheorie (DE-588)4171531-7 s Robustheit (DE-588)4126481-2 s Graphentheorie (DE-588)4113782-6 s Lecture notes in mathematics 1531 (DE-604)BV000676446 1531 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=003672484&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Stoer, Mechthild Design of survivable networks Lecture notes in mathematics Graphentheorie (DE-588)4113782-6 gnd Robustheit (DE-588)4126481-2 gnd Kostenoptimierung (DE-588)4135132-0 gnd Netzwerktopologie (DE-588)4208537-8 gnd Netzwerktheorie (DE-588)4171531-7 gnd Polyedrische Kombinatorik (DE-588)4132100-5 gnd Algorithmus (DE-588)4001183-5 gnd Redundanz (DE-588)4157937-9 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4126481-2 (DE-588)4135132-0 (DE-588)4208537-8 (DE-588)4171531-7 (DE-588)4132100-5 (DE-588)4001183-5 (DE-588)4157937-9 (DE-588)4113937-9 |
| title | Design of survivable networks |
| title_auth | Design of survivable networks |
| title_exact_search | Design of survivable networks |
| title_full | Design of survivable networks Mechthild Stoer |
| title_fullStr | Design of survivable networks Mechthild Stoer |
| title_full_unstemmed | Design of survivable networks Mechthild Stoer |
| title_short | Design of survivable networks |
| title_sort | design of survivable networks |
| topic | Graphentheorie (DE-588)4113782-6 gnd Robustheit (DE-588)4126481-2 gnd Kostenoptimierung (DE-588)4135132-0 gnd Netzwerktopologie (DE-588)4208537-8 gnd Netzwerktheorie (DE-588)4171531-7 gnd Polyedrische Kombinatorik (DE-588)4132100-5 gnd Algorithmus (DE-588)4001183-5 gnd Redundanz (DE-588)4157937-9 gnd |
| topic_facet | Graphentheorie Robustheit Kostenoptimierung Netzwerktopologie Netzwerktheorie Polyedrische Kombinatorik Algorithmus Redundanz Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=003672484&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000676446 |
| work_keys_str_mv | AT stoermechthild designofsurvivablenetworks |