Network models:
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Amsterdam [u.a.]
NH, Elsevier
1995
|
Schriftenreihe: | Handbooks in operations research and management science
7 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Literaturangaben |
Beschreibung: | XII, 786 S. graph. Darst. |
ISBN: | 0444892923 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010327918 | ||
003 | DE-604 | ||
005 | 20150619 | ||
007 | t | ||
008 | 950801s1995 ne d||| |||| 00||| eng d | ||
020 | |a 0444892923 |9 0-444-89292-3 | ||
035 | |a (OCoLC)33067843 | ||
035 | |a (DE-599)BVBBV010327918 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a ne |c XA-NL | ||
049 | |a DE-20 |a DE-12 |a DE-384 |a DE-739 |a DE-91 |a DE-521 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
050 | 0 | |a T57.85.N456 1995 | |
082 | 0 | |a 658.4/032 |2 20 | |
082 | 0 | |a 658.4/032 20 | |
084 | |a QH 452 |0 (DE-625)141595: |2 rvk | ||
084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
084 | |a 90Bxx |2 msc | ||
084 | |a 90-00 |2 msc | ||
084 | |a MAT 900f |2 stub | ||
084 | |a MAT 904f |2 stub | ||
245 | 1 | 0 | |a Network models |c ed. by M. O. Ball ... |
264 | 1 | |a Amsterdam [u.a.] |b NH, Elsevier |c 1995 | |
300 | |a XII, 786 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Handbooks in operations research and management science |v 7 | |
500 | |a Literaturangaben | ||
650 | 7 | |a Algorithmes |2 ram | |
650 | 7 | |a Analyse de réseau (planification) |2 ram | |
650 | 7 | |a Netwerken |2 gtt | |
650 | 7 | |a Operations research |2 gtt | |
650 | 7 | |a Optimisation combinatoire |2 ram | |
650 | 7 | |a Optimisation mathématique |2 ram | |
650 | 7 | |a Problème du voyageur de commerce |2 ram | |
650 | 7 | |a Programacao matematica |2 larpcal | |
650 | 7 | |a Simulation, Méthodes de |2 ram | |
650 | 7 | |a Systèmes, Analyse de |2 ram | |
650 | 7 | |a algorithme réseau |2 inriac | |
650 | 7 | |a algorithme simplexe |2 inriac | |
650 | 7 | |a appariement |2 inriac | |
650 | 7 | |a arbre |2 inriac | |
650 | 7 | |a fiabilité réseau |2 inriac | |
650 | 7 | |a géométrie algorithmique |2 inriac | |
650 | 7 | |a optimisation réseau |2 inriac | |
650 | 7 | |a réseau communication |2 inriac | |
650 | 7 | |a réseau probabiliste |2 inriac | |
650 | 7 | |a théorie graphe |2 inriac | |
650 | 7 | |a voyageur commerce |2 inriac | |
650 | 4 | |a Network analysis (Planning) | |
650 | 4 | |a Mathematical optimization | |
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Netzwerkmodell |0 (DE-588)4131643-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Netzwerktheorie |0 (DE-588)4171531-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Operations Research |0 (DE-588)4043586-6 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
689 | 0 | 0 | |a Operations Research |0 (DE-588)4043586-6 |D s |
689 | 0 | 1 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Netzwerkmodell |0 (DE-588)4131643-5 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
689 | 2 | |5 DE-604 | |
700 | 1 | |a Ball, Michael O. |e Sonstige |0 (DE-588)170461327 |4 oth | |
830 | 0 | |a Handbooks in operations research and management science |v 7 |w (DE-604)BV002805695 |9 7 | |
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=006873104&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-006873104 |
Datensatz im Suchindex
_version_ | 1804124747936563200 |
---|---|
adam_text | Contents
Preface v
CHAPTER l
Applications of Network Optimization
R.K. Ahuja, T.L. Magnanti, J.B. Orlin and M.R. Reddy, 1
1. Introduction 1
2. Preliminaries 3
3. Shortest paths 5
4. Maximum flows 17
5. Minimum cost flows 27
6. The assignment problem 35
7. Matchings 38
8. Minimum spanning trees 43
9. Convex cost flows 49
10. Generalized flows 54
11. Multicommodity flows 58
12. The traveling salesman problem 62
13. Network design 69
14. Summary 74
References 75
CHAPTER 2
Primal Simplex Algorithms for Minimum Cost Network Flows
R.V. Helgason and J.L. Kennington 85
1. Introduction 85
2. Primal simplex algorithm 93
3. Linear network models 95
4. Generalized networks 108
5. Multicommodity networks 116
6. Networks with side constraints 125
7. Reference notes 130
References 132
ix
x Contents
CHAPTER 3
Matching
A.M.H. Gerards 135
1. Introduction 135
2. Finding a matching of maximum cardinality 142
3. Bipartite matching duality 152
4. Non bipartite matching duality 159
5. Matching and integer and linear programming 164
6. Finding maximum and minimum weight matchings 172
7. General degree constraints 179
8. Other matching algorithms 191
9. Applications of matchings 202
10. Computer implementations and heuristics 207
References 212
CHAPTER 4
The Traveling Salesman Problem
M. Junger, G. Reinelt and G. Rinaldi 225
1. Introduction 225
2. Related problems 227
3. Practical applications 231
4. Approximation algorithms 234
5. Relaxations 268
6. Finding optimal and provably good solutions 294
7. Computation 314
References 323
CHAPTER 5
Parallel Computing in Network Optimization
D. Bertsekas, D. Castanon, J. Eckstein and S. Zenios 331
1. Introduction 331
2. Linear network optimization 339
3. Nonlinear network optimization 370
4. Conclusions 393
References 394
CHAPTER 6
Probabilistic Networks and Network Algorithms
T.L. Snyder and J.M. Steele 401
1. Introduction 401
2. Probability theory of network characteristics 403
3. Probabilistic network algorithms 410
Contents xi
4. Geometric networks 415
5. Concluding remarks 421
References 421
CHAPTER 7
A Survey of Computational Geometry
J.S.B. Mitchell and S. Suri 425
1. Introduction 425
2. Fundamental structures 426
3. Geometric graphs 432
4. Path planning 439
5. Matching, traveling salesman, and watchman routes 459
6. Shape analysis, computer vision, and pattern matching 462
7. Conclusion 468
References 469
CHAPTER 8
Algorithmic Implications of the Graph Minor Theorem
D. Bienstock and M.A. Langston 481
1. Introduction 481
2. A brief outline of the graph minors project 481
3. Treewidth 486
4. Pathwidth and cutwidth 493
5. Disjoint paths 495
6. Challenges to practicality 498
References 501
CHAPTER 9
Optimal Trees
T.L. Magnanti and L.A. Wolsey 503
1. Introduction 503
2. Tree optimization problems 507
3. Minimum spanning trees 518
4. Rooted subtrees of a tree 540
5. Polynomially solvable extensions/variations 548
6. The Steiner tree problem 557
7. Packing subtrees of a tree 572
8. Packing subtrees of a general graph 585
9. Trees on trees 598
10. Summary 604
11. Notes and references 607
References 611
xii Contents
CHAPTER 10
Design of Survivable Networks
M. Grotschel, C.L. Monma and M. Stoer 617
1. Overview 617
2. Motivation 618
3. Integer programming models of survivability 620
4. Structural properties and heuristics 627
5. Polynomially solvable special cases 634
6. Polyhedral results 638
7. Computational results 648
8. Directed variants of the general model 663
References 669
CHAPTER 11
Network Reliability
M.O. Ball, CJ. Colbourn and J.S. Provan 673
1. Motivation 673
2. Computational complexity and relationships among problems 680
3. Exact computation of reliability 687
4. Bounds on network reliability 696
5. Monte Carlo methods 714
6. Performability analysis and multistate network systems 722
7. Using computational techniques in practice 740
References 745
Biographical Information 763
Subject Index 769
Contents of Previous Volumes 783
|
any_adam_object | 1 |
author_GND | (DE-588)170461327 |
building | Verbundindex |
bvnumber | BV010327918 |
callnumber-first | T - Technology |
callnumber-label | T57 |
callnumber-raw | T57.85.N456 1995 |
callnumber-search | T57.85.N456 1995 |
callnumber-sort | T 257.85 N456 41995 |
callnumber-subject | T - General Technology |
classification_rvk | QH 452 SK 970 ST 200 |
classification_tum | MAT 900f MAT 904f |
ctrlnum | (OCoLC)33067843 (DE-599)BVBBV010327918 |
dewey-full | 658.4/032 658.4/03220 |
dewey-hundreds | 600 - Technology (Applied sciences) |
dewey-ones | 658 - General management |
dewey-raw | 658.4/032 658.4/032 20 |
dewey-search | 658.4/032 658.4/032 20 |
dewey-sort | 3658.4 232 |
dewey-tens | 650 - Management and auxiliary services |
discipline | Informatik Mathematik Wirtschaftswissenschaften |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03242nam a2200865 cb4500</leader><controlfield tag="001">BV010327918</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150619 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950801s1995 ne d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444892923</subfield><subfield code="9">0-444-89292-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33067843</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010327918</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">ne</subfield><subfield code="c">XA-NL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85.N456 1995</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/032</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/032 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 452</subfield><subfield code="0">(DE-625)141595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90Bxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90-00</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 900f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 904f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network models</subfield><subfield code="c">ed. by M. O. Ball ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">NH, Elsevier</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 786 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">Handbooks in operations research and management science</subfield><subfield code="v">7</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse de réseau (planification)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Netwerken</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Operations research</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation combinatoire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation mathématique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Problème du voyageur de commerce</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programacao matematica</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Simulation, Méthodes de</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Systèmes, Analyse de</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme simplexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">appariement</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">arbre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fiabilité réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">géométrie algorithmique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réseau communication</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réseau probabiliste</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">voyageur commerce</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkmodell</subfield><subfield code="0">(DE-588)4131643-5</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">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</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">Netzwerkmodell</subfield><subfield code="0">(DE-588)4131643-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">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ball, Michael O.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)170461327</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Handbooks in operations research and management science</subfield><subfield code="v">7</subfield><subfield code="w">(DE-604)BV002805695</subfield><subfield code="9">7</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=006873104&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-006873104</subfield></datafield></record></collection> |
genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
genre_facet | Aufsatzsammlung |
id | DE-604.BV010327918 |
illustrated | Illustrated |
indexdate | 2024-07-09T17:50:35Z |
institution | BVB |
isbn | 0444892923 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006873104 |
oclc_num | 33067843 |
open_access_boolean | |
owner | DE-20 DE-12 DE-384 DE-739 DE-91 DE-BY-TUM DE-521 DE-634 DE-83 DE-11 DE-188 |
owner_facet | DE-20 DE-12 DE-384 DE-739 DE-91 DE-BY-TUM DE-521 DE-634 DE-83 DE-11 DE-188 |
physical | XII, 786 S. graph. Darst. |
publishDate | 1995 |
publishDateSearch | 1995 |
publishDateSort | 1995 |
publisher | NH, Elsevier |
record_format | marc |
series | Handbooks in operations research and management science |
series2 | Handbooks in operations research and management science |
spelling | Network models ed. by M. O. Ball ... Amsterdam [u.a.] NH, Elsevier 1995 XII, 786 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Handbooks in operations research and management science 7 Literaturangaben Algorithmes ram Analyse de réseau (planification) ram Netwerken gtt Operations research gtt Optimisation combinatoire ram Optimisation mathématique ram Problème du voyageur de commerce ram Programacao matematica larpcal Simulation, Méthodes de ram Systèmes, Analyse de ram algorithme réseau inriac algorithme simplexe inriac appariement inriac arbre inriac fiabilité réseau inriac géométrie algorithmique inriac optimisation réseau inriac réseau communication inriac réseau probabiliste inriac théorie graphe inriac voyageur commerce inriac Network analysis (Planning) Mathematical optimization Algorithms Netzwerkmodell (DE-588)4131643-5 gnd rswk-swf Netzwerktheorie (DE-588)4171531-7 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Operations Research (DE-588)4043586-6 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Operations Research (DE-588)4043586-6 s Rechnernetz (DE-588)4070085-9 s DE-604 Netzwerkmodell (DE-588)4131643-5 s Netzwerktheorie (DE-588)4171531-7 s Ball, Michael O. Sonstige (DE-588)170461327 oth Handbooks in operations research and management science 7 (DE-604)BV002805695 7 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006873104&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Network models Handbooks in operations research and management science Algorithmes ram Analyse de réseau (planification) ram Netwerken gtt Operations research gtt Optimisation combinatoire ram Optimisation mathématique ram Problème du voyageur de commerce ram Programacao matematica larpcal Simulation, Méthodes de ram Systèmes, Analyse de ram algorithme réseau inriac algorithme simplexe inriac appariement inriac arbre inriac fiabilité réseau inriac géométrie algorithmique inriac optimisation réseau inriac réseau communication inriac réseau probabiliste inriac théorie graphe inriac voyageur commerce inriac Network analysis (Planning) Mathematical optimization Algorithms Netzwerkmodell (DE-588)4131643-5 gnd Netzwerktheorie (DE-588)4171531-7 gnd Rechnernetz (DE-588)4070085-9 gnd Operations Research (DE-588)4043586-6 gnd |
subject_GND | (DE-588)4131643-5 (DE-588)4171531-7 (DE-588)4070085-9 (DE-588)4043586-6 (DE-588)4143413-4 |
title | Network models |
title_auth | Network models |
title_exact_search | Network models |
title_full | Network models ed. by M. O. Ball ... |
title_fullStr | Network models ed. by M. O. Ball ... |
title_full_unstemmed | Network models ed. by M. O. Ball ... |
title_short | Network models |
title_sort | network models |
topic | Algorithmes ram Analyse de réseau (planification) ram Netwerken gtt Operations research gtt Optimisation combinatoire ram Optimisation mathématique ram Problème du voyageur de commerce ram Programacao matematica larpcal Simulation, Méthodes de ram Systèmes, Analyse de ram algorithme réseau inriac algorithme simplexe inriac appariement inriac arbre inriac fiabilité réseau inriac géométrie algorithmique inriac optimisation réseau inriac réseau communication inriac réseau probabiliste inriac théorie graphe inriac voyageur commerce inriac Network analysis (Planning) Mathematical optimization Algorithms Netzwerkmodell (DE-588)4131643-5 gnd Netzwerktheorie (DE-588)4171531-7 gnd Rechnernetz (DE-588)4070085-9 gnd Operations Research (DE-588)4043586-6 gnd |
topic_facet | Algorithmes Analyse de réseau (planification) Netwerken Operations research Optimisation combinatoire Optimisation mathématique Problème du voyageur de commerce Programacao matematica Simulation, Méthodes de Systèmes, Analyse de algorithme réseau algorithme simplexe appariement arbre fiabilité réseau géométrie algorithmique optimisation réseau réseau communication réseau probabiliste théorie graphe voyageur commerce Network analysis (Planning) Mathematical optimization Algorithms Netzwerkmodell Netzwerktheorie Rechnernetz Operations Research Aufsatzsammlung |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006873104&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV002805695 |
work_keys_str_mv | AT ballmichaelo networkmodels |