We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient ...
Recently new heuristic genetic algorithms such as Treefinder and MetaGA have been developed to search for optimal trees in a maximum likelihood (ML) framework. In this study we combined these methods ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback