A note on the blasius problem for viscoelastic fluids
โ Scribed by R. W. Serth
- Publisher
- American Institute of Chemical Engineers
- Year
- 1973
- Tongue
- English
- Weight
- 289 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0001-1541
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit
The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to