We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher
Exact and approximate algorithms for optimal network design
β Scribed by R. Dionne; M. Florian
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 946 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computational methods play a central role in the rational design of novel proteins. The present work describes a new hybrid exact rotamer optimization (HERO) method that builds on previous dead-end elimination algorithms to yield dramatic performance enhancements. Measured on experimentally validate
An approximation based on multiple function and gradient information is developed using Hermite interpolation concepts. The goal is to build a high-quality approximation for complex and multidisciplinary design optimization problems employing analysis such as aeroservoelasticity, structural control,