feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Subjects(RVK)
Access
  • 1
    Online Resource
    Online Resource
    Amsterdam ; New York : North-Holland
    UID:
    b3kat_BV036962567
    Format: 1 Online-Ressource (xi, 339 p.) , ill , 25 cm
    Edition: Online-Ausgabe Elsevier e-book collection on ScienceDirect Sonstige Standardnummer des Gesamttitels: 041169-3
    ISBN: 044489098X , 9780444890986
    Series Statement: Annals of discrete mathematics 53
    Note: Includes bibliographical references and indexes
    Additional Edition: Reproduktion von The Steiner tree problem 1992
    Language: English
    Subjects: Economics , Mathematics
    RVK:
    RVK:
    Keywords: Steiner-Baum ; Steiner-Tripelsystem
    URL: Volltext  (Deutschlandweit zugänglich)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Amsterdam u.a. :North-Holland,
    UID:
    almahu_BV007179714
    Format: XI,, 339 S. : graph. Darst.
    ISBN: 0-444-89098-X
    Series Statement: Annals of discrete mathematics 53
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    Keywords: Steiner-Tripelsystem ; Steiner-Baum
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Amsterdam ; : North-Holland,
    UID:
    almahu_9947368012402882
    Format: 1 online resource (353 p.)
    ISBN: 1-281-78968-2 , 9786611789688 , 0-08-086793-6
    Series Statement: Annals of discrete mathematics ; 53
    Content: The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field
    Note: Description based upon print version of record. , Front Cover; The Steiner Tree Problem; Copyright Page; Contents; Foreword; Part I: Euclidean Steiner Problem; Chapter 1. Introduction; 1.1. Historical Background; 1.2. Some Basic Notions; 1.3. Some Basic Properties; 1.4. Full Steiner Trees; 1.5. Steiner Hulls and Decompositions; 1.6. The Number of Steiner Topologies; 1.7 Computational Complexity; 1.8. Physical Models; References; Chapter 2. Exact Algorithms; 2.1. The Melzak Algorithm; 2.2. A Linear-Time FST Algorithm; 2.3. Two Ideas on the Melzak Algorithm; 2.4. A Numerical Algorithm; 2.5. Pruning; 2.6. The GEOSTEINER Algorithm , 2.7. The Negative Edge Algorithm2.8. The Luminary Algorithm; References; Chapter 3. The Steiner Ratio; 3.1. Lower Bounds of p; 3.2. The Small n Case; 3.3. The Variational Approach; 3.4. The Steiner Ratio Conjecture as a Maximin Problem; 3.5. Critical Structures; 3.6. A Proof of the Steiner Ratio Conjecture; References; Chapter 4. Heuristics; 4.1. Minimal Spanning Trees; 4.2. Improving the MST; 4.3. Greedy Trees; 4.4. An Annealing Algorithm; 4.5. A Partitioning Algorithm; 4.6. Few's Algorithms; 4.7. A Graph Approximation Algorithm; 4.8. k-Size Quasi-Steiner Trees; 4.9. Other Heuristics , ReferencesChapter 5. Special Terminal-Sets; 5.1. Four Terminals; 5.2. Cocircular Terminals; 5.3. Co-path Terminals; 5.4. Terminals on Lattice Points; 5.5. Two Related Results; References; Chapter 6. Generalizations; 6.1. d-Dimensional Euclidean Spaces; 6.2. Cost of Edge; 6.3. Ternlinal Clusters and New Terminals; 6.4. k-SMT; 6.5. Obstacles; References; Part II: Steiner Problem in Networks; Chapter 1. Introduction; 1.1. Applications; 1.2. Definitions; 1.3. Trivial Special Cases; 1.4. Problem Reformulations; 1.5. Complexity; References; Chapter 2. Reductions; 2.1. Exclusion Tests , 2.2. Inclusion Tests2.3. Integration of Tests; 2.4. Effectiveness of Reductions; References; Chapter 3. Exact Algorithms; 3.1. Spanning Tree Enumeration Algorithm; 3.2. Degree-Constrained Tree Enumeration Algorithm; 3.3. Topology Enumeration Algorithm; 3.4. Dynamic Programming Algorithm; 3.5. Branch-and-Bound Algorithm; 3.6. Mathematical Programming Formulations; 3.7. Linear Relaxations; 3.8. Lagrangean Relaxations; 3.9. Benders' Decomposition Algorithm; 3.10. Set Covering Algorithm; 3.11. Summary and Computational Experience; References; Chapter 4. Heuristics; 4.1. Path Heuristics , 4.2. Tree Heuristics4.3. Vertex Heuristics; 4.4. Contraction Heuristic; 4.5. Dual Ascent Heuristic; 4.6. Set Covering Heuristic; 4.7. Summary and Computational Experience; References; Chapter 5. Polynomially Solvable Cases; 5.1. Series-Parallel Networks; 5.2. Halin Networks; 5.3. k-Planar Networks; 5.4. Strongly Chordal Graphs; References; Chapter 6. Generalizations; 6.1. Steiner Trees in Directed Networks; 6.2. Weighted Steiner Tree Problem; 6.3. Steiner Forest Problem; 6.4. Hierarchical Steiner Tree Problem; 6.5. Degree-Dependent Steiner Tree Problem; 6.6. Group Steiner Tree Problem , 6.7. Multiple Steiner Trees Problem , English
    Additional Edition: ISBN 0-444-89098-X
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Singapore [u.a.] : World Scientific
    UID:
    gbv_265936128
    Format: VIII, 151 S.
    Series Statement: Series on applied mathematics 11
    Note: Literaturverz. S. 147 - 148
    Language: English
    Keywords: Switching ; Netzwerk ; Computer
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Book
    Book
    Singapore u.a. :World Scientific,
    UID:
    almafu_BV009775263
    Format: X, 249 S. : graph. Darst.
    ISBN: 981-02-1293-3
    Series Statement: Series on applied mathematics 3
    Language: English
    Subjects: Mathematics
    RVK:
    RVK:
    RVK:
    Keywords: Kombinatorische Gruppentheorie ; Statistischer Test ; Kombinatorische Gruppentheorie
    Author information: Du, Dingzhu 1948-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    b3kat_BV044635929
    Format: 1 Online-Ressource (x, 249 Seiten) , Illustrationen
    ISBN: 9789812798183
    Series Statement: Series on applied mathematics volume 3
    Content: Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, computer science and operations research. Recently, the idea of combinatorial group testing has been applied to experimental designs, coding, multiaccess computer communication, clone library screening and other fields. This book is the first attempt to cover the theory and applications of combinatorial group testing in one place
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9810212933
    Language: English
    Subjects: Mathematics
    RVK:
    RVK:
    RVK:
    Keywords: Statistischer Test ; Kombinatorische Gruppentheorie
    URL: Volltext  (URL des Erstveröffentlichers)
    Author information: Du, Dingzhu 1948-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Amsterdam u.a. :Elsevier,
    UID:
    kobvindex_ZIB000000264
    Format: 339 S.
    ISBN: 0-444-89098-X
    Series Statement: Annals of discrete mathematics Vol. 53
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Hackensack, N.J. :World Scientific,
    UID:
    edocfu_9959234708702883
    Format: 1 online resource (363 p.)
    Edition: 1st ed.
    ISBN: 981-277-015-1
    Series Statement: Series on applied mathematics ; v. 19
    Content: The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical prob
    Note: Description based upon print version of record. , Preface; Contents; 1. Formulation and Examples; 1.1 Formulation and Classification of Partitions; 1.2 Formulation and Classification of Partition Problems over Parameter Spaces; 1.3 Counting Partitions; 1.4 Examples; 1.4.1 Assembly of systems; 1.4.2 Group testing; 1.4.3 Circuit card library; 1.4.4 Clustering; 1.4.5 Abstraction of .nite state machines; 1.4.6 Multischeduling; 1.4.7 Cache assignment; 1.4.8 The blood analyzer problem; 1.4.9 Joint replenishment of inventory; 1.4.10 Statistical hypothesis testing; 1.4.11 Nearest neighbor assignment; 1.4.12 Graph partitions , 1.4.13 Traveling salesman problem1.4.14 Vehicle routing; 1.4.15 Division of property; 1.4.16 The consolidation of farm land; 2. Sum-Partition Problems over Single-Parameter Spaces: Explicit Solutions; 2.1 Bounded-Shape Problems with Linear Objective; 2.2 Constrained-Shape Problems with Schur Convex Objective; 2.3 Constrained-Shape Problems with Schur Concave Objective: Uniform (over f) Solution; 3. Extreme Points and Optimality; 3.1 Preliminaries; 3.2 Partition Polytopes; 3.3 Optimality of Extreme Points; 3.4 Asymmetric Schur Convexity , 3.5 Enumerating Vertices of Polytopes Using Restricted Edge-Directions3.6 Edge-Directions of Polyhedra in Standard Form; 3.7 Edge-Directions of Network Polyhedra; 4. Permutation Polytopes; 4.1 Permutation Polytopes with Respect to Supermodular Functions - Statement of Results; 4.2 Permutation Polytopes with Respect to Supermodular Functions - Proofs; 4.3 Permutation Polytopes Corresponding to Strictly Supermodular Functions; 4.4 Permutation Polytopes Corresponding to Strongly Supermodular Functions; 5. Sum-Partition Problems over Single-Parameter Spaces: Polyhedral Approach , 5.1 Single-Shape Partition Polytopes5.2 Constrained-Shape Partition Polytopes; 5.3 Supermodularity for Bounded-Shape Sets of Partitions; 5.4 Partition Problems with Asymmetric Schur Convex Objective: Optimization over Partition Polytopes; 6. Partitions over Single-Parameter Spaces: Combinatorial Structure; 6.1 Properties of Partitions; 6.2 Enumerating Classes of Partitions; 6.3 Local Invariance and Local Sortability; 6.4 Localizing Partition Properties: Heredity, Consistency and Sortability; 6.5 Consistency and Sortability of Particular Partition-Properties; 6.6 Extensions , 7. Partition Problems over Single-Parameter Spaces: Combinatorial Approach7.1 Applying Sortability to Optimization; 7.2 Partition Problems with Convex and Schur Convex Objective Functions; 7.3 Partition Problems with Objective Functions Depending on Part-Sizes; 7.4 Clustering Problems; 7.5 Other Problems; Bibliography; Index , English
    Additional Edition: ISBN 981-270-812-X
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Boston, MA : Springer US
    UID:
    gbv_775346357
    Format: Online-Ressource (210p) , online resource
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9781461302735
    Series Statement: Network Theory and Applications 4
    Content: Since its start in 1980 the study of the consecutive-k system has resulted in the accumulation of hundreds of research papers. Its popularity is due to its close ties with many mathematical topics such that the system has become a prototype of how mathematical analysis can help in the study of system reliability. This is the first book to put together all the material on the subject. However, it is not just a collection of results. The authors have built a framework to fit the results into and then sort them and compare them, so that the reader has a good idea what is currently the best methodology. The authors also cover important extensions such as window systems, network systems, graph systems, and 2-dimensional systems. The consecutive-k system is known for its wide applicability and the authors have included a chapter on applications. Audience: All systems engineering researchers, not just those specializing in the consecutive-k system. The book could also be used for a graduate course to demonstrate how mathematics is actually applied to systems engineering
    Note: 1. Introduction1.1 The consecutive system and generalizations -- 1.2 The problems and the methodologies -- 1.3 Notation -- 2. Computation of Reliability -- 2.1 Recursive equations -- 2.2 The matrix approach -- 2.3 The combinatorial approach -- 2.4 Bounds and approximations -- 3. Design of Optimal Consecutive Systems -- 3.1 Optimal consecutive-2 systems -- 3.2 Invariant consecutive-k systems -- 3.3 The Birnbaum importance -- 3.4 Half-line importance -- 3.5 The combinatorial importance and the rare-event importance -- 3.6 Consecutive-k G system -- 4. The Lifetime Distribution -- 4.1 Mean time to failure -- 4.2 Estimation of Parameters -- 4.3 Increasing failure rate preservation -- 4.4 IFR property for k ? 4 -- 5. Asymptotic Analysis -- 5.1 Elementary method -- 5.2 Generating function method -- 5.3 Poisson convergence method -- 5.4 The dependence models -- 5.5 Distribution for exchangeable lifetimes -- 6. Window Systems -- 6.1 The k-within-consecutive-m-out- of-n system -- 6.2 The (2, m, n) system -- 6.3 b-Fold-window systems -- 6.4 Asymptotic analysis -- 7. The Network Model -- 7.1 The linear consecutive-2 network system -- 7.2 Connectivity and hamiltonian reliability -- 7.3 The reversible model -- 7.4 The k ? 3 case -- 8. Consecutive-2 Graphs -- 8.1 Reliabilities of consecutive-2 graphs -- 8.2 Optimal consecutive-2 graphs: general theory -- 8.3 Invariant d-nary trees -- 8.4 Other consecutive-2 graphs -- 8.5 The 2-dimensional case -- 9. Some Related Systems -- 9.1 Consecutively connected systems -- 9.2 Multi-failure consecutive systems -- 9.3 Redundant consecutive-k systems -- 9.4 Weighted consecutive systems -- 10. Applications -- 10.1 Examples of modelings -- 10.2 Application examples with computations -- References.
    Additional Edition: ISBN 9781461379720
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781461379720
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9780792366614
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781461302742
    Language: English
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    b3kat_BV023824176
    Format: IX, 208 S. , graph. Darst.
    ISBN: 0792366611
    Series Statement: Network theory and applications 4
    Language: English
    Keywords: Telekommunikationsnetz ; Zuverlässigkeit
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages