Design of Survivable Networks / by Mechthild Stoer
(Lecture Notes in Mathematics ; 1531)
データ種別 | 電子ブック |
---|---|
出版情報 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer , 1992 |
本文言語 | 英語 |
大きさ | 204 p : online resource |
書誌詳細を非表示
内容注記 | 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 |
---|---|
一般注記 | The problem of designing a cost-efficient network that survives the failure of one or more nodes or edges of the network is critical to modern telecommunications engineering. The method developed in this book is designed to solve such problems to optimality. In particular, a cutting plane approach is described, based on polyhedral combinatorics, that is ableto solve real-world problems of this type in short computation time. These results are of interest for practitioners in the area of communication network design. The book is addressed especially to the combinatorial optimization community, but also to those who want to learn polyhedral methods. In addition, interesting new research problemsare formulated |
著者標目 | *Stoer, Mechthild author SpringerLink (Online service) |
件 名 | LCSH:Engineering LCSH:Chemometrics LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:System theory LCSH:Calculus of variations LCSH:Probabilities LCSH:Applied mathematics LCSH:Engineering mathematics FREE:Engineering FREE:Appl.Mathematics/Computational Methods of Engineering FREE:Mathematics of Computing FREE:Probability Theory and Stochastic Processes FREE:Systems Theory, Control FREE:Calculus of Variations and Optimal Control; Optimization FREE:Math. Applications in Chemistry |
分 類 | DC23:519 |
巻冊次 | ISBN:9783540475002 |
ISBN | 9783540475002 |
URL | http://dx.doi.org/10.1007/BFb0088963 |
目次/あらすじ
類似資料
この資料の利用統計
このページへのアクセス回数:1回
※2021年9月12日以降