The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method deve… Plus…
The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method developed in this book is designedto solve such problems to optimality. In particular, acutting plane approach is described, based on polyhedralcombinatorics, that is ableto solve real-world problems ofthis type in short computation time. These results are ofinterest for practitioners in the area of communicationnetwork design. The book is addressed especially to the combinatorialoptimization community, but also to those who want to learnpolyhedral methods. In addition, interesting new researchproblemsare formulated. | Design of Survivable Networks by Mechthild Stoer Paperback | Indigo Chapters Books > Science & Nature > Science > Engineering P10117, Mechthild Stoer<
Indigo.ca
new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
[EAN: 9783540562719], Neubuch, [PU: Springer Berlin Heidelberg], COMBINATORIALOPTIMIZATION COMMUNICATION COMMUNICATIONS CONNECTIVITY NETWORKDESIGN OPTIMIZATION POLYHEDRALCOMBINATORICS TEC… Plus…
[EAN: 9783540562719], Neubuch, [PU: Springer Berlin Heidelberg], COMBINATORIALOPTIMIZATION COMMUNICATION COMMUNICATIONS CONNECTIVITY NETWORKDESIGN OPTIMIZATION POLYHEDRALCOMBINATORICS TECHNIK ALLGEMEINES LEXIKA COMBINATORIAL NETWORK DESIGN POLYHEDRAL COMBINATORICS, Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method developed in this book is designedto solve such problems t., Books<
204 pages : graph. Darst. Unbekannter Einband Ex-Library book in good condition. 9783540562719 Netzwerktopologie ; Algorithmus Polyedrische Kombinatorik 3, [PU:Berlin ; Heidelberg ; New Y… Plus…
204 pages : graph. Darst. Unbekannter Einband Ex-Library book in good condition. 9783540562719 Netzwerktopologie ; Algorithmus Polyedrische Kombinatorik 3, [PU:Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer,]<
Achtung-Buecher.de
Antiquariat Bookfarm Sebastian Seckfort, 04509 Löbnitz Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method deve… Plus…
The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method developed in this book is designedto solve such problems to optimality. In particular, acutting plane approach is described, based on polyhedralcombinatorics, that is ableto solve real-world problems ofthis type in short computation time. These results are ofinterest for practitioners in the area of communicationnetwork design. The book is addressed especially to the combinatorialoptimization community, but also to those who want to learnpolyhedral methods. In addition, interesting new researchproblemsare formulated. | Design of Survivable Networks by Mechthild Stoer Paperback | Indigo Chapters Books > Science & Nature > Science > Engineering P10117, Mechthild Stoer<
new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
[EAN: 9783540562719], Neubuch, [PU: Springer Berlin Heidelberg], COMBINATORIALOPTIMIZATION COMMUNICATION COMMUNICATIONS CONNECTIVITY NETWORKDESIGN OPTIMIZATION POLYHEDRALCOMBINATORICS TEC… Plus…
[EAN: 9783540562719], Neubuch, [PU: Springer Berlin Heidelberg], COMBINATORIALOPTIMIZATION COMMUNICATION COMMUNICATIONS CONNECTIVITY NETWORKDESIGN OPTIMIZATION POLYHEDRALCOMBINATORICS TECHNIK ALLGEMEINES LEXIKA COMBINATORIAL NETWORK DESIGN POLYHEDRAL COMBINATORICS, Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method developed in this book is designedto solve such problems t., Books<
204 pages : graph. Darst. Unbekannter Einband Ex-Library book in good condition. 9783540562719 Netzwerktopologie ; Algorithmus Polyedrische Kombinatorik 3, [PU:Berlin ; Heidelberg ; New Y… Plus…
204 pages : graph. Darst. Unbekannter Einband Ex-Library book in good condition. 9783540562719 Netzwerktopologie ; Algorithmus Polyedrische Kombinatorik 3, [PU:Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer,]<
Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) Antiquariat Bookfarm Sebastian Seckfort, 04509 Löbnitz
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.
Données bibliographiques du meilleur livre correspondant
The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method developed in this book is designedto solve such problems to optimality. In particular, acutting plane approach is described, based on polyhedralcombinatorics, that is ableto solve real-world problems ofthis type in short computation time. These results are ofinterest for practitioners in the area of communicationnetwork design.The book is addressed especially to the combinatorialoptimization community, but also to those who want to learnpolyhedral methods. In addition, interesting new researchproblemsare formulated.
Informations détaillées sur le livre - Design of Survivable Networks
EAN (ISBN-13): 9783540562719 ISBN (ISBN-10): 3540562710 Livre de poche Date de parution: 1992 Editeur: Springer Berlin Heidelberg 212 Pages Poids: 0,328 kg Langue: eng/Englisch
Livre dans la base de données depuis 2008-12-19T09:17:45+01:00 (Zurich) Page de détail modifiée en dernier sur 2024-01-14T20:47:36+01:00 (Zurich) ISBN/EAN: 3540562710
ISBN - Autres types d'écriture: 3-540-56271-0, 978-3-540-56271-9 Autres types d'écriture et termes associés: Auteur du livre: stör, mechthild, stoer Titre du livre: 1531, networks, design design
Données de l'éditeur
Auteur: Mechthild Stoer Titre: Lecture Notes in Mathematics; Design of Survivable Networks Editeur: Springer; Springer Berlin 204 Pages Date de parution: 1992-12-14 Berlin; Heidelberg; DE Langue: Anglais 37,40 € (DE) 38,45 € (AT) 50,60 CHF (CH) Available 204 p.
BC; Hardcover, Softcover / Technik/Allgemeines, Lexika; Mathematik für Ingenieure; Verstehen; combinatorial optimization; communication; communications; connectivity; network design; optimization; polyhedral combinatorics; Mathematical and Computational Engineering Applications; Mathematics of Computing; Probability Theory; Systems Theory, Control; Calculus of Variations and Optimization; Mathematical Applications in Chemistry; Mathematik für Informatiker; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Kybernetik und Systemtheorie; Optimierung; Quanten- und theoretische Chemie; EA
Motivation.- Network survivability models using node types.- Survivable network design under connectivity constraints — a survey.- Decomposition.- Basic inequalities.- Lifting theorems.- Partition inequalities.- Node partition inequalities.- Lifted r-cover inequalities.- Comb inequalities.- How to find valid inequalities.- Implementation of the cutting plane algorithm.- Computational results.
Autres livres qui pourraient ressembler au livre recherché:
