𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results

✍ Scribed by Pietro S. Oliveto; Jun He; Xin Yao

Book ID
107435658
Publisher
Institute of Automation, Chinese Academy of Sciences
Year
2007
Tongue
English
Weight
298 KB
Volume
4
Category
Article
ISSN
1476-8186

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A combinatorial algorithm for the discre
A combinatorial algorithm for the discrete optimization of structures
✍ Chai Shan; Sun Huanchun πŸ“‚ Article πŸ“… 1997 πŸ› Springer 🌐 English βš– 599 KB

The definition of local optimum solution of the discrete optimi:ation is first given, and then a comprehensive combinatorial algorithm is proposed in this paper. Two-level optimum method is used in the algorithm. In the first ieve optimkaiion, un approximate locai optimum solution x is found by usi

A combinatorial description of the close
A combinatorial description of the closest tree algorithm for finding evolutionary trees
✍ Michael D. Hendy πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 382 KB

The closest tree algorithΒ’a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va