Verfügbarkeit: Design and scheduling problems in planning optical networks

Design and scheduling problems in planning optical networks:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Maurer, Olaf (VerfasserIn)
Format:	Abschlussarbeit Buch
Sprache:	English
Veröffentlicht:	Göttingen Cuvillier Verlag 2016
Ausgabe:	1. Auflage
Schlagworte:	Lichtleitfaser Reihenfolgeproblem Optisches Kommunikationsnetz Approximationsalgorithmus Ganzzahlige Optimierung Dekomposition Standortproblem Kombinatorische Optimierung Frequenzzuweisung Netzplanung Approximation Algorithms Approximationsalgorithmen Combinatorial Optimization Facility Location Fiber-optic network Ganzzahlige Programmierung Glasfasernetzwerke Integer Programming Lagrange-Dekomposition Lagrangean Decomposition Network Design Netzwerkdesign Reihenfolgeplanung Scheduling Standortplanung Telecommunication Networks Telekommunikationsnetzwerke Hochschulschrift
Online-Zugang:	Inhaltsverzeichnis Inhaltsverzeichnis
Beschreibung:	208 Seiten Illustrationen 21 cm
ISBN:	9783736993877 3736993870

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV044624929
003	DE-604
005	20171219
007	t
008	171114s2016 gw a\|\|\| m\|\|\| 00\|\|\| eng d
015			\|a 16,N48 \|2 dnb
015			\|a 17,A42 \|2 dnb
015			\|a 17,H11 \|2 dnb
016	7		\|a 1119741912 \|2 DE-101
020			\|a 9783736993877 \|c Broschur : EUR 52.80 (DE), EUR 54.30 (AT) \|9 978-3-7369-9387-7
020			\|a 3736993870 \|9 3-7369-9387-0
024	3		\|a 9783736993877
035			\|a (OCoLC)994280633
035			\|a (DE-599)DNB1119741912
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a gw \|c XA-DE-NI
049			\|a DE-83
082	0		\|a 621.38275 \|2 22/ger
084			\|a ZN 6280 \|0 (DE-625)157542: \|2 rvk
084			\|a 621.3 \|2 sdnb
100	1		\|a Maurer, Olaf \|e Verfasser \|4 aut
245	1	0	\|a Design and scheduling problems in planning optical networks \|c Olaf Maurer
250			\|a 1. Auflage
264		1	\|a Göttingen \|b Cuvillier Verlag \|c 2016
300			\|a 208 Seiten \|b Illustrationen \|c 21 cm
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
502			\|b Dissertation \|c Universität Kassel \|d 2016
650	0	7	\|a Lichtleitfaser \|0 (DE-588)4167589-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Reihenfolgeproblem \|0 (DE-588)4242167-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Optisches Kommunikationsnetz \|0 (DE-588)7826356-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Ganzzahlige Optimierung \|0 (DE-588)4155950-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Dekomposition \|0 (DE-588)4149030-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Standortproblem \|0 (DE-588)4301515-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Frequenzzuweisung \|0 (DE-588)4663589-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzplanung \|0 (DE-588)4171522-6 \|2 gnd \|9 rswk-swf
653			\|a Kombinatorische Optimierung
653			\|a Approximation Algorithms
653			\|a Approximationsalgorithmen
653			\|a Combinatorial Optimization
653			\|a Facility Location
653			\|a Fiber-optic network
653			\|a Ganzzahlige Programmierung
653			\|a Glasfasernetzwerke
653			\|a Integer Programming
653			\|a Lagrange-Dekomposition
653			\|a Lagrangean Decomposition
653			\|a Network Design
653			\|a Netzwerkdesign
653			\|a Reihenfolgeplanung
653			\|a Scheduling
653			\|a Standortplanung
653			\|a Telecommunication Networks
653			\|a Telekommunikationsnetzwerke
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Optisches Kommunikationsnetz \|0 (DE-588)7826356-6 \|D s
689	0	1	\|a Lichtleitfaser \|0 (DE-588)4167589-7 \|D s
689	0	2	\|a Netzplanung \|0 (DE-588)4171522-6 \|D s
689	0	3	\|a Reihenfolgeproblem \|0 (DE-588)4242167-6 \|D s
689	0	4	\|a Standortproblem \|0 (DE-588)4301515-3 \|D s
689	0	5	\|a Frequenzzuweisung \|0 (DE-588)4663589-0 \|D s
689	0	6	\|a Ganzzahlige Optimierung \|0 (DE-588)4155950-2 \|D s
689	0	7	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	0	8	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	0	9	\|a Dekomposition \|0 (DE-588)4149030-7 \|D s
689	0		\|5 DE-604
710	2		\|a Eric Cuvillier (Firma) \|0 (DE-588)1067137041 \|4 pbl
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-3-7369-8387-8
856	4	2	\|m B:DE-101 \|q application/pdf \|u http://d-nb.info/1119741912/04 \|3 Inhaltsverzeichnis
856	4	2	\|m DNB Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030023101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-030023101

Datensatz im Suchindex

_version_	1804178029411303424
adam_text	CONTENTS INTRODUCTION 7 1 TECHNICAL AND MATHEMATICAL BACKGROUND 13 1.1 PLANNING OPTICAL NETWORKS .................................................................................. 13 1.1.1 NETWORK CONFIGURATIONS.......................................................................... 14 1.1.2 HIERARCHICAL NETWORK STRUCTURE.............................................................. 15 1.1.3 OPTICAL ACCESS NETWORKS.......................................................................... 16 1.1.4 COLLISION AVOIDANCE ............................................................................... 17 1.2 TECHNICAL BACKGROUND........................................................................................ 18 1.2.1 HARDWARE COMPONENTS............................................................................. 21 1.2.2 PHYSICAL LIMITS OF OPTICAL NETWORKS........................................................ 26 1.3 MATHEMATICAL BACKGROUND .................................................................................. 27 1.3.1 LINEAR ALGEBRA ........................................................................................ 28 1.3.2 GRAPH THEORY........................................................................................... 29 1.3.3 COMPUTATIONAL COMPLEXITY.................................................................... 29 1.3.4 LINEAR AND INTEGER PROGRAMMING........................................................... 36 1.3.5 ALGORITHMS FOR LPS AND ILPS ................................................................. 38 1.3.6 MODELLING NETWORK PROBLEMS................................................................. 41 2 PASSIVE OPTICAL NETWORK DESIGN 49 2.1 THE TWO-LAYER FTTX NETWORK DESIGN PROBLEM ............................................... 49 2.1.1 INTRODUCTION........................................................................................... 49 2.1.2 PROBLEM SETTING........................................................................................ 49 2.1.3 RELATED W ORK........................................................................................... 51 2.2 MIP MODEL............................................................................................................. 52 2.2.1 PROBLEM INPUT AND CONSTRAINTS.............................................................. 52 2.2.2 VALID INEQUALITIES FOR THE AGGREGATED MIP M ODEL................................. 56 2.3 LAGRANGIAN DECOMPOSITIONS ............................................................................... 57 2.3.1 FEEDER-DISTRIBUTION DECOMPOSITION..................................................... 58 2.3.2 FIXEDCHARGE-FLOW DECOMPOSITION........................................................ 60 2.3.3 GENERIC LAGRANGIAN FRAMEWORK........................................................... 64 2.4 COMPUTATIONAL RESULTS ........................................................................................ 66 2.4.1 BRANCH&CUT ALGORITHMS.......................................................................... 66 2.4.2 BENCHMARK INSTANCES ............................................................................ 70 2.4.3 COMPUTATIONS ........................................................................................ 72 2.5 CONCLUSIONS.......................................................................................................... 74 3 NODE-WEIGHTED STEINER PROBLEMS 81 3.1 THE NODE-WEIGHTED DOMINATING STEINER PROBLEM.............................................. 81 3.1.1 INTRODUCTION............................................................................................ 81 3.1.2 PROBLEM SETTING......................................................................................... 81 3.1.3 RELATED W ORK............................................................................................ 82 3.2 INTEGER PROGRAMMING FORMULATION....................................................................... 85 3.3 POLYHEDRAL INVESTIGATIONS...................................................................................... 86 3.3.1 BASIC PROPERTIES ...................................................................................... 86 3.3.2 MODEL INEQUALITIES................................................................................... 88 3.4 PARTITION INEQUALITIES............................................................................................ 92 3.4.1 LIFTED PARTITION INEQUALITIES.................................................................... 95 3.4.2 A COMPLETE DESCRIPTION OF P ON A CYCLE ................................................... 96 3.4.3 INDEGREE INEQUALITIES................................................................................ 110 3.5 COMPUTATIONAL EXPERIMENTS................................................................................ 111 3.5.1 INSTANCES................................................................................................. 111 3.5.2 IMPLEMENTATION...................................................................................... 111 3.5.3 RESULTS .................................................................................................... 112 3.6 CONCLUSIONS.......................................................................................................... 113 4 INCREMENTAL FACILITY LOCATION 115 4.1 THE INCREMENTAL UFL PROBLEM............................................................................. 115 4.1.1 INTRODUCTION............................................................................................ 115 4.1.2 PROBLEM SETTING......................................................................................... 117 4.1.3 TWO-PHASE ALGORITHM .......................................................................... 118 4.2 ANALYSIS................................................................................................................ 119 4.3 LOWER BOUND ....................................................................................................... 121 4.4 COMPUTATIONAL EXPERIMENTS................................................................................ 122 4.5 CONCLUSIONS.......................................................................................................... 122 5 INCREMENTAL CONNECTED FACILITY LOCATION 125 5.1 THE INCREMENTAL CONNECTED UFL PROBLEM ........................................................ 125 5.1.1 INTRODUCTION............................................................................................ 125 5.1.2 PROBLEM SETTING......................................................................................... 125 5.1.3 RELATED W ORK ........................................................................................... 126 5.2 MIP M ODELS.......................................................................................................... 127 5.2.1 VALID INEQUALITIES...................................................................................... 129 5.3 SEPARATION ALGORITHMS......................................................................................... 131 5.4 EXPERIMENTS.......................................................................................................... 132 5.5 CONCLUSIONS.......................................................................................................... 136 6 FREQUENCY ASSIGNMENT IN OPTICAL NETWORKS 137 6.1 SPECTRUM ASSIGNMENT PROBLEM .......................................................................... 137 6.1.1 INTRODUCTION............................................................................................ 137 6.1.2 PROBLEM SETTING......................................................................................... 138 6.1.3 COMPUTATIONAL COMPLEXITY.................................................................... 138 6.1.4 RELATED W ORK............................................................................................ 139 6.2 PHASE I: ARTICULATION POINT HEURISTIC ................................................................. 140 6.2.1 LOWER BOUNDS ........................................................................................ 141 6.2.2 HEURISTIC ALGORITHM ............................................................................... 141 6.2.3 HOPCROFT-TARJ AN ALGORITHM .................................................................... 143 6.3 PHASE II: MULTICOLORING FORMULATION.................................................................... 144 6.4 PHASE III: EXACT MODELS........................................................................................ 146 6.4.1 CONSTRAINT PROGRAMMING M ODEL........................................................... 147 6.4.2 BINARY MODEL........................................................................................... 147 6.4.3 CONFLICT-GRAPH ORIENTING M ODEL........................................................... 148 6.4.4 BRANCH&PRICE MODEL................................................................................ 149 6.5 COMPUTATIONAL EXPERIMENTS................................................................................ 153 6.5.1 TEST INSTANCES........................................................................................... 153 6.5.2 COMPUTATIONAL EXPERIMENTS.................................................................... 153 6.6 CONCLUSIONS.......................................................................................................... 157 7 ONLINE SCHEDULING 161 7.1 ONLINE SCHEDULING PROBLEMS ............................................................................... 161 7.1.1 INTRODUCTION........................................................................................... 161 7.1.2 PROBLEM SETTING..................................................................................... 162 7.1.3 RELATED W ORK........................................................................................... 163 7.2 GENERAL SIMPLIFICATIONS AND TECHNIQUES.............................................................. 165 7.2.1 SIMPLIFICATION WITHIN INTERVALS.............................................................. 166 7.2.2 IRRELEVANT HISTORY..................................................................................... 170 7.3 ABSTRACTION OF ONLINE ALGORITHMS ......................................................................... 177 7.4 EXTENSIONS TO OTHER SETTINGS ............................................................................... 182 7.4.1 NON-PREEMPTIVE SCHEDULING.................................................................... 182 7.4.2 SCHEDULING ON RELATED MACHINES ........................................................... 188 7.5 CONCLUSIONS.......................................................................................................... 191 BIBLIOGRAPHY 193
any_adam_object	1
author	Maurer, Olaf
author_facet	Maurer, Olaf
author_role	aut
author_sort	Maurer, Olaf
author_variant	o m om
building	Verbundindex
bvnumber	BV044624929
classification_rvk	ZN 6280
ctrlnum	(OCoLC)994280633 (DE-599)DNB1119741912
dewey-full	621.38275
dewey-hundreds	600 - Technology (Applied sciences)
dewey-ones	621 - Applied physics
dewey-raw	621.38275
dewey-search	621.38275
dewey-sort	3621.38275
dewey-tens	620 - Engineering and allied operations
discipline	Elektrotechnik / Elektronik / Nachrichtentechnik
edition	1. Auflage
format	Thesis Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03713nam a2200925 c 4500</leader><controlfield tag="001">BV044624929</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171219 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">171114s2016 gw a\|\|\| m\|\|\| 00\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">16,N48</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">17,A42</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">17,H11</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1119741912</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783736993877</subfield><subfield code="c">Broschur : EUR 52.80 (DE), EUR 54.30 (AT)</subfield><subfield code="9">978-3-7369-9387-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3736993870</subfield><subfield code="9">3-7369-9387-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783736993877</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)994280633</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1119741912</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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">XA-DE-NI</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.38275</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 6280</subfield><subfield code="0">(DE-625)157542:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">621.3</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Maurer, Olaf</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design and scheduling problems in planning optical networks</subfield><subfield code="c">Olaf Maurer</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Auflage</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Göttingen</subfield><subfield code="b">Cuvillier Verlag</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">208 Seiten</subfield><subfield code="b">Illustrationen</subfield><subfield code="c">21 cm</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Universität Kassel</subfield><subfield code="d">2016</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lichtleitfaser</subfield><subfield code="0">(DE-588)4167589-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optisches Kommunikationsnetz</subfield><subfield code="0">(DE-588)7826356-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Frequenzzuweisung</subfield><subfield code="0">(DE-588)4663589-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzplanung</subfield><subfield code="0">(DE-588)4171522-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kombinatorische Optimierung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximation Algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximationsalgorithmen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorial Optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Facility Location</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Fiber-optic network</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ganzzahlige Programmierung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Glasfasernetzwerke</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Integer Programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lagrange-Dekomposition</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lagrangean Decomposition</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network Design</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Netzwerkdesign</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Reihenfolgeplanung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Standortplanung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Telecommunication Networks</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Telekommunikationsnetzwerke</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">Optisches Kommunikationsnetz</subfield><subfield code="0">(DE-588)7826356-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Lichtleitfaser</subfield><subfield code="0">(DE-588)4167589-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Netzplanung</subfield><subfield code="0">(DE-588)4171522-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Frequenzzuweisung</subfield><subfield code="0">(DE-588)4663589-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="6"><subfield code="a">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="8"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="9"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Eric Cuvillier (Firma)</subfield><subfield code="0">(DE-588)1067137041</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-7369-8387-8</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">B:DE-101</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://d-nb.info/1119741912/04</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=030023101&sequence=000001&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-030023101</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV044624929
illustrated	Illustrated
indexdate	2024-07-10T07:57:28Z
institution	BVB
institution_GND	(DE-588)1067137041
isbn	9783736993877 3736993870
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-030023101
oclc_num	994280633
open_access_boolean
owner	DE-83
owner_facet	DE-83
physical	208 Seiten Illustrationen 21 cm
publishDate	2016
publishDateSearch	2016
publishDateSort	2016
publisher	Cuvillier Verlag
record_format	marc
spelling	Maurer, Olaf Verfasser aut Design and scheduling problems in planning optical networks Olaf Maurer 1. Auflage Göttingen Cuvillier Verlag 2016 208 Seiten Illustrationen 21 cm txt rdacontent n rdamedia nc rdacarrier Dissertation Universität Kassel 2016 Lichtleitfaser (DE-588)4167589-7 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Optisches Kommunikationsnetz (DE-588)7826356-6 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Ganzzahlige Optimierung (DE-588)4155950-2 gnd rswk-swf Dekomposition (DE-588)4149030-7 gnd rswk-swf Standortproblem (DE-588)4301515-3 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Frequenzzuweisung (DE-588)4663589-0 gnd rswk-swf Netzplanung (DE-588)4171522-6 gnd rswk-swf Kombinatorische Optimierung Approximation Algorithms Approximationsalgorithmen Combinatorial Optimization Facility Location Fiber-optic network Ganzzahlige Programmierung Glasfasernetzwerke Integer Programming Lagrange-Dekomposition Lagrangean Decomposition Network Design Netzwerkdesign Reihenfolgeplanung Scheduling Standortplanung Telecommunication Networks Telekommunikationsnetzwerke (DE-588)4113937-9 Hochschulschrift gnd-content Optisches Kommunikationsnetz (DE-588)7826356-6 s Lichtleitfaser (DE-588)4167589-7 s Netzplanung (DE-588)4171522-6 s Reihenfolgeproblem (DE-588)4242167-6 s Standortproblem (DE-588)4301515-3 s Frequenzzuweisung (DE-588)4663589-0 s Ganzzahlige Optimierung (DE-588)4155950-2 s Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s Dekomposition (DE-588)4149030-7 s DE-604 Eric Cuvillier (Firma) (DE-588)1067137041 pbl Erscheint auch als Online-Ausgabe 978-3-7369-8387-8 B:DE-101 application/pdf http://d-nb.info/1119741912/04 Inhaltsverzeichnis DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030023101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Maurer, Olaf Design and scheduling problems in planning optical networks Lichtleitfaser (DE-588)4167589-7 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Optisches Kommunikationsnetz (DE-588)7826356-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd Dekomposition (DE-588)4149030-7 gnd Standortproblem (DE-588)4301515-3 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Frequenzzuweisung (DE-588)4663589-0 gnd Netzplanung (DE-588)4171522-6 gnd
subject_GND	(DE-588)4167589-7 (DE-588)4242167-6 (DE-588)7826356-6 (DE-588)4500954-5 (DE-588)4155950-2 (DE-588)4149030-7 (DE-588)4301515-3 (DE-588)4031826-6 (DE-588)4663589-0 (DE-588)4171522-6 (DE-588)4113937-9
title	Design and scheduling problems in planning optical networks
title_auth	Design and scheduling problems in planning optical networks
title_exact_search	Design and scheduling problems in planning optical networks
title_full	Design and scheduling problems in planning optical networks Olaf Maurer
title_fullStr	Design and scheduling problems in planning optical networks Olaf Maurer
title_full_unstemmed	Design and scheduling problems in planning optical networks Olaf Maurer
title_short	Design and scheduling problems in planning optical networks
title_sort	design and scheduling problems in planning optical networks
topic	Lichtleitfaser (DE-588)4167589-7 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Optisches Kommunikationsnetz (DE-588)7826356-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd Dekomposition (DE-588)4149030-7 gnd Standortproblem (DE-588)4301515-3 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Frequenzzuweisung (DE-588)4663589-0 gnd Netzplanung (DE-588)4171522-6 gnd
topic_facet	Lichtleitfaser Reihenfolgeproblem Optisches Kommunikationsnetz Approximationsalgorithmus Ganzzahlige Optimierung Dekomposition Standortproblem Kombinatorische Optimierung Frequenzzuweisung Netzplanung Hochschulschrift
url	http://d-nb.info/1119741912/04 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030023101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT maurerolaf designandschedulingproblemsinplanningopticalnetworks AT ericcuvillierfirma designandschedulingproblemsinplanningopticalnetworks

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis
Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge