Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4958992 | Computers & Operations Research | 2017 | 21 Pages |
Abstract
Shrink and Cut algorithm is designed to simplify original complex hyperstructure without changing the optimal solution of the Min-Max hyperstructure equipartition with a connected constraint problem. By the use of this algorithm, Min-Max hyper-tree equipartition with a connected constraint can be solved in polynomial time. An exact algorithm: Min-Max hyperstructure partitioning algorithm, based on a Shrink and Cut algorithm and algorithm S for finding all the spanning trees, is designed to solve ordinary cases, which shows well on experimental results.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Tunzi Tan, Suixiang Gao, Juan A. Mesa,