An exact algorithm for solving the ring star problem
✍ Scribed by Kedad-Sidhoum, Safia; Nguyen, Viet Hung
- Book ID
- 121254227
- Publisher
- Taylor and Francis Group
- Year
- 2010
- Tongue
- English
- Weight
- 225 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0233-1934
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In the Ring Star Problem, the aim is to locate a simple cycle through a subset of vertices of a graph with the objective of minimizing the sum of two costs: a ring cost proportional to the length of the cycle and an assignment cost from the vertices not in the cycle to their closest ver
## Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings __R__~1~,…,__R__~__K__~, with __n__~1~,…,__n__~__K__~ distinct nodes, respectively, we need to find an ordering of the nodes in
In this Note, we introduce a partitioned Newton based method for solving nonlinear coupled systems arising in the numerical approximation of fluid-structure interaction problems. The originality of this Schur-Newton algorithm lies in the exact Jacobians evaluation involving the fluid-structure linea